./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--mtd--sm_ftl.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--mtd--sm_ftl.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 66513110c58cbfd09ef37c44af5b1d4813bd7e87bef538ae0fb21419e856753a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 21:38:24,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 21:38:24,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 21:38:24,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 21:38:24,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 21:38:24,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 21:38:24,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 21:38:24,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 21:38:24,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 21:38:24,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 21:38:24,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 21:38:24,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 21:38:24,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 21:38:24,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 21:38:24,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 21:38:24,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 21:38:24,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 21:38:24,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 21:38:24,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 21:38:24,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 21:38:24,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 21:38:24,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 21:38:24,343 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 21:38:24,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 21:38:24,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 21:38:24,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 21:38:24,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 21:38:24,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 21:38:24,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 21:38:24,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 21:38:24,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 21:38:24,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 21:38:24,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 21:38:24,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 21:38:24,356 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 21:38:24,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 21:38:24,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 21:38:24,357 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 21:38:24,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 21:38:24,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 21:38:24,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 21:38:24,360 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 21:38:24,393 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 21:38:24,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 21:38:24,394 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 21:38:24,394 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 21:38:24,396 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 21:38:24,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 21:38:24,396 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 21:38:24,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 21:38:24,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 21:38:24,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 21:38:24,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 21:38:24,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 21:38:24,398 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 21:38:24,398 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 21:38:24,399 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 21:38:24,399 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 21:38:24,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 21:38:24,399 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 21:38:24,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 21:38:24,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:38:24,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 21:38:24,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 21:38:24,400 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 21:38:24,400 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 21:38:24,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 21:38:24,401 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 21:38:24,401 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 21:38:24,401 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 21:38:24,401 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 21:38:24,402 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 -> 66513110c58cbfd09ef37c44af5b1d4813bd7e87bef538ae0fb21419e856753a [2021-11-06 21:38:24,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 21:38:24,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 21:38:24,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 21:38:24,662 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 21:38:24,663 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 21:38:24,664 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--mtd--sm_ftl.ko.cil.i [2021-11-06 21:38:24,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8766cc714/4a40f8b3302d443ab98f7ac85f0cb1ce/FLAGdd9d45ae0 [2021-11-06 21:38:25,493 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 21:38:25,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i [2021-11-06 21:38:25,545 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8766cc714/4a40f8b3302d443ab98f7ac85f0cb1ce/FLAGdd9d45ae0 [2021-11-06 21:38:25,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8766cc714/4a40f8b3302d443ab98f7ac85f0cb1ce [2021-11-06 21:38:25,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 21:38:25,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 21:38:25,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 21:38:25,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 21:38:25,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 21:38:25,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:38:25" (1/1) ... [2021-11-06 21:38:25,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bff8143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:38:25, skipping insertion in model container [2021-11-06 21:38:25,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:38:25" (1/1) ... [2021-11-06 21:38:25,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 21:38:25,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 21:38:28,158 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260078,260091] [2021-11-06 21:38:28,162 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260223,260236] [2021-11-06 21:38:28,163 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260369,260382] [2021-11-06 21:38:28,164 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260534,260547] [2021-11-06 21:38:28,164 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260692,260705] [2021-11-06 21:38:28,170 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260850,260863] [2021-11-06 21:38:28,170 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261008,261021] [2021-11-06 21:38:28,171 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261168,261181] [2021-11-06 21:38:28,171 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261327,261340] [2021-11-06 21:38:28,171 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261466,261479] [2021-11-06 21:38:28,172 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261608,261621] [2021-11-06 21:38:28,172 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261757,261770] [2021-11-06 21:38:28,173 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261896,261909] [2021-11-06 21:38:28,173 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262051,262064] [2021-11-06 21:38:28,173 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262211,262224] [2021-11-06 21:38:28,174 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262362,262375] [2021-11-06 21:38:28,174 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262513,262526] [2021-11-06 21:38:28,174 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262665,262678] [2021-11-06 21:38:28,175 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262814,262827] [2021-11-06 21:38:28,176 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262962,262975] [2021-11-06 21:38:28,177 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263119,263132] [2021-11-06 21:38:28,177 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263268,263281] [2021-11-06 21:38:28,178 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263424,263437] [2021-11-06 21:38:28,178 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263577,263590] [2021-11-06 21:38:28,179 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263723,263736] [2021-11-06 21:38:28,180 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263866,263879] [2021-11-06 21:38:28,181 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264018,264031] [2021-11-06 21:38:28,181 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264164,264177] [2021-11-06 21:38:28,182 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264309,264322] [2021-11-06 21:38:28,182 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264463,264476] [2021-11-06 21:38:28,183 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264614,264627] [2021-11-06 21:38:28,184 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264769,264782] [2021-11-06 21:38:28,207 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264921,264934] [2021-11-06 21:38:28,208 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265076,265089] [2021-11-06 21:38:28,208 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265240,265253] [2021-11-06 21:38:28,208 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265396,265409] [2021-11-06 21:38:28,209 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265560,265573] [2021-11-06 21:38:28,209 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265702,265715] [2021-11-06 21:38:28,209 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265860,265873] [2021-11-06 21:38:28,210 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266027,266040] [2021-11-06 21:38:28,210 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266186,266199] [2021-11-06 21:38:28,210 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266345,266358] [2021-11-06 21:38:28,210 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266494,266507] [2021-11-06 21:38:28,211 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266641,266654] [2021-11-06 21:38:28,211 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266780,266793] [2021-11-06 21:38:28,211 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266943,266956] [2021-11-06 21:38:28,212 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267109,267122] [2021-11-06 21:38:28,212 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267273,267286] [2021-11-06 21:38:28,212 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267438,267451] [2021-11-06 21:38:28,212 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267603,267616] [2021-11-06 21:38:28,213 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267769,267782] [2021-11-06 21:38:28,213 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267934,267947] [2021-11-06 21:38:28,213 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268101,268114] [2021-11-06 21:38:28,214 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268261,268274] [2021-11-06 21:38:28,214 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268423,268436] [2021-11-06 21:38:28,214 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268582,268595] [2021-11-06 21:38:28,214 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268728,268741] [2021-11-06 21:38:28,215 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268871,268884] [2021-11-06 21:38:28,219 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269015,269028] [2021-11-06 21:38:28,221 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269158,269171] [2021-11-06 21:38:28,222 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269302,269315] [2021-11-06 21:38:28,223 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269443,269456] [2021-11-06 21:38:28,223 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269581,269594] [2021-11-06 21:38:28,223 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269739,269752] [2021-11-06 21:38:28,224 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269898,269911] [2021-11-06 21:38:28,224 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270054,270067] [2021-11-06 21:38:28,225 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270203,270216] [2021-11-06 21:38:28,225 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270355,270368] [2021-11-06 21:38:28,226 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270506,270519] [2021-11-06 21:38:28,226 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270655,270668] [2021-11-06 21:38:28,227 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270807,270820] [2021-11-06 21:38:28,227 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270955,270968] [2021-11-06 21:38:28,228 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271108,271121] [2021-11-06 21:38:28,229 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271259,271272] [2021-11-06 21:38:28,230 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271409,271422] [2021-11-06 21:38:28,231 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271556,271569] [2021-11-06 21:38:28,232 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271707,271720] [2021-11-06 21:38:28,232 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271858,271871] [2021-11-06 21:38:28,233 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272006,272019] [2021-11-06 21:38:28,233 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272172,272185] [2021-11-06 21:38:28,234 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272341,272354] [2021-11-06 21:38:28,234 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272508,272521] [2021-11-06 21:38:28,234 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272676,272689] [2021-11-06 21:38:28,235 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272826,272839] [2021-11-06 21:38:28,235 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272973,272986] [2021-11-06 21:38:28,237 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273134,273147] [2021-11-06 21:38:28,238 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273304,273317] [2021-11-06 21:38:28,238 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273466,273479] [2021-11-06 21:38:28,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:38:28,272 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 21:38:28,472 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260078,260091] [2021-11-06 21:38:28,473 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260223,260236] [2021-11-06 21:38:28,473 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260369,260382] [2021-11-06 21:38:28,474 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260534,260547] [2021-11-06 21:38:28,474 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260692,260705] [2021-11-06 21:38:28,474 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260850,260863] [2021-11-06 21:38:28,475 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261008,261021] [2021-11-06 21:38:28,475 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261168,261181] [2021-11-06 21:38:28,475 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261327,261340] [2021-11-06 21:38:28,476 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261466,261479] [2021-11-06 21:38:28,476 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261608,261621] [2021-11-06 21:38:28,476 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261757,261770] [2021-11-06 21:38:28,477 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261896,261909] [2021-11-06 21:38:28,477 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262051,262064] [2021-11-06 21:38:28,477 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262211,262224] [2021-11-06 21:38:28,478 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262362,262375] [2021-11-06 21:38:28,478 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262513,262526] [2021-11-06 21:38:28,478 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262665,262678] [2021-11-06 21:38:28,479 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262814,262827] [2021-11-06 21:38:28,479 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262962,262975] [2021-11-06 21:38:28,479 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263119,263132] [2021-11-06 21:38:28,480 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263268,263281] [2021-11-06 21:38:28,480 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263424,263437] [2021-11-06 21:38:28,480 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263577,263590] [2021-11-06 21:38:28,481 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263723,263736] [2021-11-06 21:38:28,481 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263866,263879] [2021-11-06 21:38:28,481 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264018,264031] [2021-11-06 21:38:28,482 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264164,264177] [2021-11-06 21:38:28,482 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264309,264322] [2021-11-06 21:38:28,482 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264463,264476] [2021-11-06 21:38:28,483 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264614,264627] [2021-11-06 21:38:28,483 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264769,264782] [2021-11-06 21:38:28,483 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264921,264934] [2021-11-06 21:38:28,484 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265076,265089] [2021-11-06 21:38:28,484 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265240,265253] [2021-11-06 21:38:28,484 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265396,265409] [2021-11-06 21:38:28,485 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265560,265573] [2021-11-06 21:38:28,485 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265702,265715] [2021-11-06 21:38:28,485 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265860,265873] [2021-11-06 21:38:28,486 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266027,266040] [2021-11-06 21:38:28,486 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266186,266199] [2021-11-06 21:38:28,486 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266345,266358] [2021-11-06 21:38:28,487 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266494,266507] [2021-11-06 21:38:28,487 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266641,266654] [2021-11-06 21:38:28,488 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266780,266793] [2021-11-06 21:38:28,488 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266943,266956] [2021-11-06 21:38:28,488 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267109,267122] [2021-11-06 21:38:28,489 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267273,267286] [2021-11-06 21:38:28,489 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267438,267451] [2021-11-06 21:38:28,489 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267603,267616] [2021-11-06 21:38:28,489 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267769,267782] [2021-11-06 21:38:28,490 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267934,267947] [2021-11-06 21:38:28,490 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268101,268114] [2021-11-06 21:38:28,490 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268261,268274] [2021-11-06 21:38:28,491 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268423,268436] [2021-11-06 21:38:28,491 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268582,268595] [2021-11-06 21:38:28,492 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268728,268741] [2021-11-06 21:38:28,492 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268871,268884] [2021-11-06 21:38:28,492 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269015,269028] [2021-11-06 21:38:28,493 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269158,269171] [2021-11-06 21:38:28,493 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269302,269315] [2021-11-06 21:38:28,493 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269443,269456] [2021-11-06 21:38:28,494 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269581,269594] [2021-11-06 21:38:28,494 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269739,269752] [2021-11-06 21:38:28,494 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269898,269911] [2021-11-06 21:38:28,495 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270054,270067] [2021-11-06 21:38:28,495 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270203,270216] [2021-11-06 21:38:28,495 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270355,270368] [2021-11-06 21:38:28,496 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270506,270519] [2021-11-06 21:38:28,496 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270655,270668] [2021-11-06 21:38:28,496 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270807,270820] [2021-11-06 21:38:28,497 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270955,270968] [2021-11-06 21:38:28,497 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271108,271121] [2021-11-06 21:38:28,497 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271259,271272] [2021-11-06 21:38:28,498 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271409,271422] [2021-11-06 21:38:28,498 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271556,271569] [2021-11-06 21:38:28,498 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271707,271720] [2021-11-06 21:38:28,498 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271858,271871] [2021-11-06 21:38:28,499 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272006,272019] [2021-11-06 21:38:28,499 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272172,272185] [2021-11-06 21:38:28,499 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272341,272354] [2021-11-06 21:38:28,500 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272508,272521] [2021-11-06 21:38:28,500 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272676,272689] [2021-11-06 21:38:28,500 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272826,272839] [2021-11-06 21:38:28,501 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272973,272986] [2021-11-06 21:38:28,501 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273134,273147] [2021-11-06 21:38:28,501 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273304,273317] [2021-11-06 21:38:28,501 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273466,273479] [2021-11-06 21:38:28,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:38:28,650 INFO L208 MainTranslator]: Completed translation [2021-11-06 21:38:28,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:38:28 WrapperNode [2021-11-06 21:38:28,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 21:38:28,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 21:38:28,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 21:38:28,652 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 21:38:28,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:38:28" (1/1) ... [2021-11-06 21:38:28,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:38:28" (1/1) ... [2021-11-06 21:38:29,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 21:38:29,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 21:38:29,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 21:38:29,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 21:38:29,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:38:28" (1/1) ... [2021-11-06 21:38:29,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:38:28" (1/1) ... [2021-11-06 21:38:29,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:38:28" (1/1) ... [2021-11-06 21:38:29,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:38:28" (1/1) ... [2021-11-06 21:38:29,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:38:28" (1/1) ... [2021-11-06 21:38:29,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:38:28" (1/1) ... [2021-11-06 21:38:29,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:38:28" (1/1) ... [2021-11-06 21:38:29,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 21:38:29,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 21:38:29,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 21:38:29,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 21:38:29,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:38:28" (1/1) ... [2021-11-06 21:38:29,798 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:38:29,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:38:29,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 21:38:29,860 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-06 21:38:29,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 21:38:29,861 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_sector [2021-11-06 21:38:29,861 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_sector [2021-11-06 21:38:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 21:38:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 21:38:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 21:38:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 21:38:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure sm_recheck_media [2021-11-06 21:38:29,862 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_recheck_media [2021-11-06 21:38:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_cis [2021-11-06 21:38:29,863 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_cis [2021-11-06 21:38:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 21:38:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 21:38:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 21:38:29,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 21:38:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 21:38:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 21:38:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 21:38:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 21:38:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 21:38:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 21:38:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 21:38:37,169 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_7_returnLabel: main_#res := 0; [2021-11-06 21:38:37,169 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L6476: #t~ret760 := main_#res; [2021-11-06 21:38:37,170 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-06 21:38:37,366 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 21:38:37,367 INFO L299 CfgBuilder]: Removed 2674 assume(true) statements. [2021-11-06 21:38:37,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:38:37 BoogieIcfgContainer [2021-11-06 21:38:37,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 21:38:37,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 21:38:37,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 21:38:37,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 21:38:37,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:38:25" (1/3) ... [2021-11-06 21:38:37,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6709dc9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:38:37, skipping insertion in model container [2021-11-06 21:38:37,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:38:28" (2/3) ... [2021-11-06 21:38:37,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6709dc9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:38:37, skipping insertion in model container [2021-11-06 21:38:37,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:38:37" (3/3) ... [2021-11-06 21:38:37,382 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i [2021-11-06 21:38:37,387 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 21:38:37,387 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 85 error locations. [2021-11-06 21:38:37,445 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 21:38:37,455 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 21:38:37,456 INFO L340 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2021-11-06 21:38:37,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 2923 states, 2785 states have (on average 1.4125673249551167) internal successors, (3934), 2869 states have internal predecessors, (3934), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-06 21:38:37,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-06 21:38:37,518 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:37,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] [2021-11-06 21:38:37,519 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:37,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:37,524 INFO L85 PathProgramCache]: Analyzing trace with hash 731718049, now seen corresponding path program 1 times [2021-11-06 21:38:37,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:37,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196972805] [2021-11-06 21:38:37,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:37,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:37,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:37,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:37,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196972805] [2021-11-06 21:38:37,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196972805] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:37,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:37,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:37,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249573355] [2021-11-06 21:38:37,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:37,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:37,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:37,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:37,963 INFO L87 Difference]: Start difference. First operand has 2923 states, 2785 states have (on average 1.4125673249551167) internal successors, (3934), 2869 states have internal predecessors, (3934), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:38,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:38,174 INFO L93 Difference]: Finished difference Result 5818 states and 8032 transitions. [2021-11-06 21:38:38,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:38,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-11-06 21:38:38,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:38,206 INFO L225 Difference]: With dead ends: 5818 [2021-11-06 21:38:38,207 INFO L226 Difference]: Without dead ends: 2866 [2021-11-06 21:38:38,219 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:38,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2866 states. [2021-11-06 21:38:38,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2866 to 2866. [2021-11-06 21:38:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2866 states, 2730 states have (on average 1.3564102564102565) internal successors, (3703), 2812 states have internal predecessors, (3703), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-06 21:38:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 3803 transitions. [2021-11-06 21:38:38,407 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 3803 transitions. Word has length 20 [2021-11-06 21:38:38,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:38,409 INFO L470 AbstractCegarLoop]: Abstraction has 2866 states and 3803 transitions. [2021-11-06 21:38:38,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 3803 transitions. [2021-11-06 21:38:38,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-06 21:38:38,414 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:38,414 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] [2021-11-06 21:38:38,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 21:38:38,416 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:38,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:38,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1193195579, now seen corresponding path program 1 times [2021-11-06 21:38:38,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:38,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979195636] [2021-11-06 21:38:38,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:38,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:38,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:38,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979195636] [2021-11-06 21:38:38,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979195636] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:38,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:38,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:38,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473621806] [2021-11-06 21:38:38,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:38,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:38,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:38,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:38,594 INFO L87 Difference]: Start difference. First operand 2866 states and 3803 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:38,709 INFO L93 Difference]: Finished difference Result 2866 states and 3803 transitions. [2021-11-06 21:38:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:38,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-11-06 21:38:38,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:38,727 INFO L225 Difference]: With dead ends: 2866 [2021-11-06 21:38:38,727 INFO L226 Difference]: Without dead ends: 2862 [2021-11-06 21:38:38,730 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:38,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2021-11-06 21:38:38,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2862. [2021-11-06 21:38:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2862 states, 2728 states have (on average 1.3559384164222874) internal successors, (3699), 2808 states have internal predecessors, (3699), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-06 21:38:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 3799 transitions. [2021-11-06 21:38:38,853 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 3799 transitions. Word has length 22 [2021-11-06 21:38:38,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:38,853 INFO L470 AbstractCegarLoop]: Abstraction has 2862 states and 3799 transitions. [2021-11-06 21:38:38,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:38,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 3799 transitions. [2021-11-06 21:38:38,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-06 21:38:38,855 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:38,855 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:38:38,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 21:38:38,855 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:38,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:38,856 INFO L85 PathProgramCache]: Analyzing trace with hash 95712841, now seen corresponding path program 1 times [2021-11-06 21:38:38,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:38,857 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085999041] [2021-11-06 21:38:38,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:38,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:38,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:38,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:38,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085999041] [2021-11-06 21:38:38,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085999041] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:38,943 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:38,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:38,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318005253] [2021-11-06 21:38:38,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:38,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:38,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:38,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:38,945 INFO L87 Difference]: Start difference. First operand 2862 states and 3799 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:39,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:39,059 INFO L93 Difference]: Finished difference Result 2862 states and 3799 transitions. [2021-11-06 21:38:39,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:39,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-11-06 21:38:39,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:39,077 INFO L225 Difference]: With dead ends: 2862 [2021-11-06 21:38:39,077 INFO L226 Difference]: Without dead ends: 2858 [2021-11-06 21:38:39,080 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:39,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2021-11-06 21:38:39,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2858. [2021-11-06 21:38:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2858 states, 2726 states have (on average 1.355465884079237) internal successors, (3695), 2804 states have internal predecessors, (3695), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-06 21:38:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 3795 transitions. [2021-11-06 21:38:39,196 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 3795 transitions. Word has length 24 [2021-11-06 21:38:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:39,196 INFO L470 AbstractCegarLoop]: Abstraction has 2858 states and 3795 transitions. [2021-11-06 21:38:39,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:39,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 3795 transitions. [2021-11-06 21:38:39,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-06 21:38:39,202 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:39,202 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] [2021-11-06 21:38:39,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 21:38:39,202 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:39,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:39,203 INFO L85 PathProgramCache]: Analyzing trace with hash 345137859, now seen corresponding path program 1 times [2021-11-06 21:38:39,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:39,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577038027] [2021-11-06 21:38:39,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:39,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:39,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:39,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577038027] [2021-11-06 21:38:39,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577038027] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:39,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:39,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:39,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915105282] [2021-11-06 21:38:39,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:39,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:39,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:39,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:39,349 INFO L87 Difference]: Start difference. First operand 2858 states and 3795 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:39,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:39,605 INFO L93 Difference]: Finished difference Result 3517 states and 4584 transitions. [2021-11-06 21:38:39,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:38:39,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-11-06 21:38:39,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:39,621 INFO L225 Difference]: With dead ends: 3517 [2021-11-06 21:38:39,621 INFO L226 Difference]: Without dead ends: 3509 [2021-11-06 21:38:39,624 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:39,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3509 states. [2021-11-06 21:38:39,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3509 to 2959. [2021-11-06 21:38:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2959 states, 2825 states have (on average 1.3564601769911504) internal successors, (3832), 2899 states have internal predecessors, (3832), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 3938 transitions. [2021-11-06 21:38:39,746 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 3938 transitions. Word has length 25 [2021-11-06 21:38:39,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:39,748 INFO L470 AbstractCegarLoop]: Abstraction has 2959 states and 3938 transitions. [2021-11-06 21:38:39,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 3938 transitions. [2021-11-06 21:38:39,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-06 21:38:39,751 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:39,751 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] [2021-11-06 21:38:39,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 21:38:39,752 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:39,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1786123565, now seen corresponding path program 1 times [2021-11-06 21:38:39,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:39,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457003261] [2021-11-06 21:38:39,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:39,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:39,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:39,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457003261] [2021-11-06 21:38:39,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457003261] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:39,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:39,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:39,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001113948] [2021-11-06 21:38:39,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:39,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:39,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:39,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:39,875 INFO L87 Difference]: Start difference. First operand 2959 states and 3938 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:39,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:39,988 INFO L93 Difference]: Finished difference Result 2959 states and 3938 transitions. [2021-11-06 21:38:39,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:39,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-11-06 21:38:39,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:40,002 INFO L225 Difference]: With dead ends: 2959 [2021-11-06 21:38:40,003 INFO L226 Difference]: Without dead ends: 2955 [2021-11-06 21:38:40,005 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:40,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2021-11-06 21:38:40,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2955. [2021-11-06 21:38:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2955 states, 2823 states have (on average 1.3560042507970245) internal successors, (3828), 2895 states have internal predecessors, (3828), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 3934 transitions. [2021-11-06 21:38:40,122 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 3934 transitions. Word has length 26 [2021-11-06 21:38:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:40,123 INFO L470 AbstractCegarLoop]: Abstraction has 2955 states and 3934 transitions. [2021-11-06 21:38:40,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3934 transitions. [2021-11-06 21:38:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-06 21:38:40,124 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:40,124 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] [2021-11-06 21:38:40,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 21:38:40,125 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:40,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:40,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1521775503, now seen corresponding path program 1 times [2021-11-06 21:38:40,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:40,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704340930] [2021-11-06 21:38:40,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:40,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:40,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:40,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704340930] [2021-11-06 21:38:40,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704340930] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:40,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:40,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:40,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120766826] [2021-11-06 21:38:40,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:40,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:40,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:40,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:40,200 INFO L87 Difference]: Start difference. First operand 2955 states and 3934 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:40,300 INFO L93 Difference]: Finished difference Result 2955 states and 3934 transitions. [2021-11-06 21:38:40,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:40,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-11-06 21:38:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:40,312 INFO L225 Difference]: With dead ends: 2955 [2021-11-06 21:38:40,313 INFO L226 Difference]: Without dead ends: 2951 [2021-11-06 21:38:40,314 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:40,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2021-11-06 21:38:40,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2951. [2021-11-06 21:38:40,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2951 states, 2821 states have (on average 1.3555476781283233) internal successors, (3824), 2891 states have internal predecessors, (3824), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:40,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 3930 transitions. [2021-11-06 21:38:40,418 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 3930 transitions. Word has length 28 [2021-11-06 21:38:40,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:40,418 INFO L470 AbstractCegarLoop]: Abstraction has 2951 states and 3930 transitions. [2021-11-06 21:38:40,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 3930 transitions. [2021-11-06 21:38:40,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-06 21:38:40,420 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:40,420 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:38:40,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 21:38:40,420 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:40,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:40,421 INFO L85 PathProgramCache]: Analyzing trace with hash -2136980459, now seen corresponding path program 1 times [2021-11-06 21:38:40,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:40,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869876347] [2021-11-06 21:38:40,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:40,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:40,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:40,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869876347] [2021-11-06 21:38:40,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869876347] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:40,491 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:40,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:40,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961867666] [2021-11-06 21:38:40,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:40,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:40,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:40,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:40,493 INFO L87 Difference]: Start difference. First operand 2951 states and 3930 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:40,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:40,649 INFO L93 Difference]: Finished difference Result 2951 states and 3930 transitions. [2021-11-06 21:38:40,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:40,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2021-11-06 21:38:40,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:40,662 INFO L225 Difference]: With dead ends: 2951 [2021-11-06 21:38:40,662 INFO L226 Difference]: Without dead ends: 2947 [2021-11-06 21:38:40,664 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:40,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2021-11-06 21:38:40,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 2947. [2021-11-06 21:38:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2947 states, 2819 states have (on average 1.3550904576090812) internal successors, (3820), 2887 states have internal predecessors, (3820), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:40,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 3926 transitions. [2021-11-06 21:38:40,782 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 3926 transitions. Word has length 30 [2021-11-06 21:38:40,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:40,783 INFO L470 AbstractCegarLoop]: Abstraction has 2947 states and 3926 transitions. [2021-11-06 21:38:40,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 3926 transitions. [2021-11-06 21:38:40,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-06 21:38:40,784 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:40,784 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] [2021-11-06 21:38:40,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 21:38:40,784 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:40,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:40,785 INFO L85 PathProgramCache]: Analyzing trace with hash 193161591, now seen corresponding path program 1 times [2021-11-06 21:38:40,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:40,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044970101] [2021-11-06 21:38:40,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:40,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:40,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:40,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044970101] [2021-11-06 21:38:40,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044970101] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:40,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:40,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:38:40,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756345455] [2021-11-06 21:38:40,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:38:40,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:40,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:38:40,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:40,894 INFO L87 Difference]: Start difference. First operand 2947 states and 3926 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:41,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:41,434 INFO L93 Difference]: Finished difference Result 7368 states and 9779 transitions. [2021-11-06 21:38:41,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 21:38:41,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-06 21:38:41,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:41,453 INFO L225 Difference]: With dead ends: 7368 [2021-11-06 21:38:41,453 INFO L226 Difference]: Without dead ends: 4440 [2021-11-06 21:38:41,464 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 21:38:41,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4440 states. [2021-11-06 21:38:41,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4440 to 2947. [2021-11-06 21:38:41,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2947 states, 2819 states have (on average 1.3515431003902092) internal successors, (3810), 2887 states have internal predecessors, (3810), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:41,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 3916 transitions. [2021-11-06 21:38:41,612 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 3916 transitions. Word has length 32 [2021-11-06 21:38:41,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:41,612 INFO L470 AbstractCegarLoop]: Abstraction has 2947 states and 3916 transitions. [2021-11-06 21:38:41,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:41,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 3916 transitions. [2021-11-06 21:38:41,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-06 21:38:41,614 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:41,614 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] [2021-11-06 21:38:41,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 21:38:41,614 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:41,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:41,615 INFO L85 PathProgramCache]: Analyzing trace with hash 193221173, now seen corresponding path program 1 times [2021-11-06 21:38:41,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:41,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953955164] [2021-11-06 21:38:41,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:41,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:41,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:41,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953955164] [2021-11-06 21:38:41,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953955164] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:41,688 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:41,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:38:41,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848161394] [2021-11-06 21:38:41,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:41,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:41,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:41,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:41,689 INFO L87 Difference]: Start difference. First operand 2947 states and 3916 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:42,142 INFO L93 Difference]: Finished difference Result 4449 states and 5874 transitions. [2021-11-06 21:38:42,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:38:42,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-06 21:38:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:42,160 INFO L225 Difference]: With dead ends: 4449 [2021-11-06 21:38:42,160 INFO L226 Difference]: Without dead ends: 4429 [2021-11-06 21:38:42,163 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:42,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4429 states. [2021-11-06 21:38:42,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4429 to 2927. [2021-11-06 21:38:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2809 states have (on average 1.3492346030615878) internal successors, (3790), 2867 states have internal predecessors, (3790), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 3896 transitions. [2021-11-06 21:38:42,328 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 3896 transitions. Word has length 32 [2021-11-06 21:38:42,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:42,328 INFO L470 AbstractCegarLoop]: Abstraction has 2927 states and 3896 transitions. [2021-11-06 21:38:42,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 3896 transitions. [2021-11-06 21:38:42,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-06 21:38:42,330 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:42,330 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] [2021-11-06 21:38:42,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 21:38:42,331 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:42,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:42,331 INFO L85 PathProgramCache]: Analyzing trace with hash -643455975, now seen corresponding path program 1 times [2021-11-06 21:38:42,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:42,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907703323] [2021-11-06 21:38:42,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:42,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:42,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:42,436 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907703323] [2021-11-06 21:38:42,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907703323] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:42,436 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:42,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:42,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568226436] [2021-11-06 21:38:42,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:42,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:42,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:42,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:42,438 INFO L87 Difference]: Start difference. First operand 2927 states and 3896 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:42,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:42,584 INFO L93 Difference]: Finished difference Result 2927 states and 3896 transitions. [2021-11-06 21:38:42,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:42,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-06 21:38:42,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:42,592 INFO L225 Difference]: With dead ends: 2927 [2021-11-06 21:38:42,593 INFO L226 Difference]: Without dead ends: 2923 [2021-11-06 21:38:42,595 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:42,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2021-11-06 21:38:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 2923. [2021-11-06 21:38:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2923 states, 2807 states have (on average 1.3487709298183113) internal successors, (3786), 2863 states have internal predecessors, (3786), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:42,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 3892 transitions. [2021-11-06 21:38:42,801 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 3892 transitions. Word has length 32 [2021-11-06 21:38:42,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:42,801 INFO L470 AbstractCegarLoop]: Abstraction has 2923 states and 3892 transitions. [2021-11-06 21:38:42,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:42,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 3892 transitions. [2021-11-06 21:38:42,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-06 21:38:42,802 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:42,802 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 21:38:42,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 21:38:42,802 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:42,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:42,803 INFO L85 PathProgramCache]: Analyzing trace with hash -431818633, now seen corresponding path program 1 times [2021-11-06 21:38:42,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:42,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748467313] [2021-11-06 21:38:42,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:42,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:42,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:42,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:42,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748467313] [2021-11-06 21:38:42,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748467313] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:42,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:42,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:38:42,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74973006] [2021-11-06 21:38:42,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:42,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:42,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:42,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:42,934 INFO L87 Difference]: Start difference. First operand 2923 states and 3892 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 21:38:44,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:44,250 INFO L93 Difference]: Finished difference Result 5585 states and 7436 transitions. [2021-11-06 21:38:44,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:38:44,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 21:38:44,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:44,264 INFO L225 Difference]: With dead ends: 5585 [2021-11-06 21:38:44,265 INFO L226 Difference]: Without dead ends: 5577 [2021-11-06 21:38:44,268 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:44,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5577 states. [2021-11-06 21:38:44,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5577 to 2915. [2021-11-06 21:38:44,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2915 states, 2803 states have (on average 1.3478415982875491) internal successors, (3778), 2855 states have internal predecessors, (3778), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 3884 transitions. [2021-11-06 21:38:44,481 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 3884 transitions. Word has length 33 [2021-11-06 21:38:44,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:44,481 INFO L470 AbstractCegarLoop]: Abstraction has 2915 states and 3884 transitions. [2021-11-06 21:38:44,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 21:38:44,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 3884 transitions. [2021-11-06 21:38:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-06 21:38:44,482 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:44,482 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] [2021-11-06 21:38:44,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 21:38:44,482 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:44,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:44,483 INFO L85 PathProgramCache]: Analyzing trace with hash 114496637, now seen corresponding path program 1 times [2021-11-06 21:38:44,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:44,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822745841] [2021-11-06 21:38:44,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:44,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:44,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:44,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:44,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822745841] [2021-11-06 21:38:44,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822745841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:44,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:44,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:44,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654847686] [2021-11-06 21:38:44,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:44,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:44,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:44,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:44,560 INFO L87 Difference]: Start difference. First operand 2915 states and 3884 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:44,727 INFO L93 Difference]: Finished difference Result 2915 states and 3884 transitions. [2021-11-06 21:38:44,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:44,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2021-11-06 21:38:44,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:44,734 INFO L225 Difference]: With dead ends: 2915 [2021-11-06 21:38:44,734 INFO L226 Difference]: Without dead ends: 2911 [2021-11-06 21:38:44,735 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:44,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2021-11-06 21:38:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2911. [2021-11-06 21:38:44,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2911 states, 2801 states have (on average 1.347375937165298) internal successors, (3774), 2851 states have internal predecessors, (3774), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 3880 transitions. [2021-11-06 21:38:44,959 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 3880 transitions. Word has length 34 [2021-11-06 21:38:44,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:44,960 INFO L470 AbstractCegarLoop]: Abstraction has 2911 states and 3880 transitions. [2021-11-06 21:38:44,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 3880 transitions. [2021-11-06 21:38:44,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-06 21:38:44,961 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:44,961 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 21:38:44,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 21:38:44,961 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:44,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:44,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1007037135, now seen corresponding path program 1 times [2021-11-06 21:38:44,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:44,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780134210] [2021-11-06 21:38:44,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:44,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:45,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:45,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780134210] [2021-11-06 21:38:45,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780134210] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:45,025 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:45,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 21:38:45,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247032180] [2021-11-06 21:38:45,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:38:45,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:45,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:38:45,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:38:45,026 INFO L87 Difference]: Start difference. First operand 2911 states and 3880 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 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 21:38:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:45,214 INFO L93 Difference]: Finished difference Result 5773 states and 7708 transitions. [2021-11-06 21:38:45,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:38:45,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 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 21:38:45,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:45,221 INFO L225 Difference]: With dead ends: 5773 [2021-11-06 21:38:45,221 INFO L226 Difference]: Without dead ends: 2881 [2021-11-06 21:38:45,228 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:38:45,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2021-11-06 21:38:45,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2881. [2021-11-06 21:38:45,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2881 states, 2781 states have (on average 1.3426824883135562) internal successors, (3734), 2821 states have internal predecessors, (3734), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 3840 transitions. [2021-11-06 21:38:45,406 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 3840 transitions. Word has length 35 [2021-11-06 21:38:45,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:45,407 INFO L470 AbstractCegarLoop]: Abstraction has 2881 states and 3840 transitions. [2021-11-06 21:38:45,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 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 21:38:45,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 3840 transitions. [2021-11-06 21:38:45,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 21:38:45,408 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:45,408 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] [2021-11-06 21:38:45,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 21:38:45,408 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:45,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:45,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1637484192, now seen corresponding path program 1 times [2021-11-06 21:38:45,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:45,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912155940] [2021-11-06 21:38:45,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:45,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:45,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:45,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912155940] [2021-11-06 21:38:45,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912155940] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:45,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:45,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:45,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598046896] [2021-11-06 21:38:45,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:45,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:45,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:45,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:45,499 INFO L87 Difference]: Start difference. First operand 2881 states and 3840 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:45,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:45,664 INFO L93 Difference]: Finished difference Result 2881 states and 3840 transitions. [2021-11-06 21:38:45,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:45,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-11-06 21:38:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:45,671 INFO L225 Difference]: With dead ends: 2881 [2021-11-06 21:38:45,671 INFO L226 Difference]: Without dead ends: 2877 [2021-11-06 21:38:45,673 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:45,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2021-11-06 21:38:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 2877. [2021-11-06 21:38:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2877 states, 2779 states have (on average 1.3422094278517451) internal successors, (3730), 2817 states have internal predecessors, (3730), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 3836 transitions. [2021-11-06 21:38:45,904 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 3836 transitions. Word has length 36 [2021-11-06 21:38:45,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:45,905 INFO L470 AbstractCegarLoop]: Abstraction has 2877 states and 3836 transitions. [2021-11-06 21:38:45,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 3836 transitions. [2021-11-06 21:38:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-06 21:38:45,906 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:45,906 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] [2021-11-06 21:38:45,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 21:38:45,906 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:45,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:45,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1663879516, now seen corresponding path program 1 times [2021-11-06 21:38:45,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:45,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728001372] [2021-11-06 21:38:45,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:45,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:45,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:45,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728001372] [2021-11-06 21:38:45,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728001372] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:45,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:45,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:45,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333883855] [2021-11-06 21:38:45,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:45,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:45,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:45,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:45,991 INFO L87 Difference]: Start difference. First operand 2877 states and 3836 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:46,159 INFO L93 Difference]: Finished difference Result 2877 states and 3836 transitions. [2021-11-06 21:38:46,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:46,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-11-06 21:38:46,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:46,166 INFO L225 Difference]: With dead ends: 2877 [2021-11-06 21:38:46,166 INFO L226 Difference]: Without dead ends: 2873 [2021-11-06 21:38:46,168 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2021-11-06 21:38:46,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2873. [2021-11-06 21:38:46,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2873 states, 2777 states have (on average 1.3417356859920777) internal successors, (3726), 2813 states have internal predecessors, (3726), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2873 states to 2873 states and 3832 transitions. [2021-11-06 21:38:46,341 INFO L78 Accepts]: Start accepts. Automaton has 2873 states and 3832 transitions. Word has length 38 [2021-11-06 21:38:46,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:46,341 INFO L470 AbstractCegarLoop]: Abstraction has 2873 states and 3832 transitions. [2021-11-06 21:38:46,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:46,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states and 3832 transitions. [2021-11-06 21:38:46,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-06 21:38:46,342 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:46,342 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] [2021-11-06 21:38:46,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 21:38:46,343 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:46,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:46,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1259981752, now seen corresponding path program 1 times [2021-11-06 21:38:46,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:46,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822831876] [2021-11-06 21:38:46,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:46,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:46,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:46,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822831876] [2021-11-06 21:38:46,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822831876] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:46,416 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:46,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:46,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909287205] [2021-11-06 21:38:46,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:46,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:46,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:46,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:46,417 INFO L87 Difference]: Start difference. First operand 2873 states and 3832 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:46,591 INFO L93 Difference]: Finished difference Result 2873 states and 3832 transitions. [2021-11-06 21:38:46,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:46,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2021-11-06 21:38:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:46,597 INFO L225 Difference]: With dead ends: 2873 [2021-11-06 21:38:46,598 INFO L226 Difference]: Without dead ends: 2869 [2021-11-06 21:38:46,599 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2021-11-06 21:38:46,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 2869. [2021-11-06 21:38:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2869 states, 2775 states have (on average 1.3412612612612613) internal successors, (3722), 2809 states have internal predecessors, (3722), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:46,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 3828 transitions. [2021-11-06 21:38:46,848 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 3828 transitions. Word has length 40 [2021-11-06 21:38:46,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:46,848 INFO L470 AbstractCegarLoop]: Abstraction has 2869 states and 3828 transitions. [2021-11-06 21:38:46,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:46,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 3828 transitions. [2021-11-06 21:38:46,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 21:38:46,850 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:46,850 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] [2021-11-06 21:38:46,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 21:38:46,850 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:46,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:46,851 INFO L85 PathProgramCache]: Analyzing trace with hash 338713164, now seen corresponding path program 1 times [2021-11-06 21:38:46,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:46,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189075004] [2021-11-06 21:38:46,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:46,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:46,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:46,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189075004] [2021-11-06 21:38:46,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189075004] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:46,920 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:46,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:46,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187907720] [2021-11-06 21:38:46,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:46,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:46,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:46,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:46,923 INFO L87 Difference]: Start difference. First operand 2869 states and 3828 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:47,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:47,104 INFO L93 Difference]: Finished difference Result 2869 states and 3828 transitions. [2021-11-06 21:38:47,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:47,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2021-11-06 21:38:47,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:47,111 INFO L225 Difference]: With dead ends: 2869 [2021-11-06 21:38:47,111 INFO L226 Difference]: Without dead ends: 2865 [2021-11-06 21:38:47,113 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:47,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2021-11-06 21:38:47,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2865. [2021-11-06 21:38:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2865 states, 2773 states have (on average 1.3407861521817526) internal successors, (3718), 2805 states have internal predecessors, (3718), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 3824 transitions. [2021-11-06 21:38:47,293 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 3824 transitions. Word has length 42 [2021-11-06 21:38:47,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:47,294 INFO L470 AbstractCegarLoop]: Abstraction has 2865 states and 3824 transitions. [2021-11-06 21:38:47,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 3824 transitions. [2021-11-06 21:38:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-06 21:38:47,295 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:47,295 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] [2021-11-06 21:38:47,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 21:38:47,295 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:47,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:47,296 INFO L85 PathProgramCache]: Analyzing trace with hash -913764176, now seen corresponding path program 1 times [2021-11-06 21:38:47,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:47,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757377650] [2021-11-06 21:38:47,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:47,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:47,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:47,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757377650] [2021-11-06 21:38:47,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757377650] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:47,372 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:47,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:47,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748854159] [2021-11-06 21:38:47,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:47,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:47,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:47,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:47,374 INFO L87 Difference]: Start difference. First operand 2865 states and 3824 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:47,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:47,561 INFO L93 Difference]: Finished difference Result 2865 states and 3824 transitions. [2021-11-06 21:38:47,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:47,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-06 21:38:47,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:47,568 INFO L225 Difference]: With dead ends: 2865 [2021-11-06 21:38:47,568 INFO L226 Difference]: Without dead ends: 2861 [2021-11-06 21:38:47,569 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:47,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2021-11-06 21:38:47,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 2861. [2021-11-06 21:38:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2771 states have (on average 1.340310357271743) internal successors, (3714), 2801 states have internal predecessors, (3714), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 3820 transitions. [2021-11-06 21:38:47,866 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 3820 transitions. Word has length 44 [2021-11-06 21:38:47,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:47,866 INFO L470 AbstractCegarLoop]: Abstraction has 2861 states and 3820 transitions. [2021-11-06 21:38:47,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 3820 transitions. [2021-11-06 21:38:47,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-06 21:38:47,868 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:47,868 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] [2021-11-06 21:38:47,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 21:38:47,868 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:47,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:47,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1953644684, now seen corresponding path program 1 times [2021-11-06 21:38:47,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:47,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379457567] [2021-11-06 21:38:47,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:47,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:47,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:47,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:47,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379457567] [2021-11-06 21:38:47,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379457567] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:47,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:47,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:47,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46331167] [2021-11-06 21:38:47,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:47,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:47,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:47,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:47,949 INFO L87 Difference]: Start difference. First operand 2861 states and 3820 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:48,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:48,196 INFO L93 Difference]: Finished difference Result 2861 states and 3820 transitions. [2021-11-06 21:38:48,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:48,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2021-11-06 21:38:48,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:48,203 INFO L225 Difference]: With dead ends: 2861 [2021-11-06 21:38:48,203 INFO L226 Difference]: Without dead ends: 2857 [2021-11-06 21:38:48,204 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:48,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2021-11-06 21:38:48,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2857. [2021-11-06 21:38:48,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2857 states, 2769 states have (on average 1.3398338750451426) internal successors, (3710), 2797 states have internal predecessors, (3710), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 3816 transitions. [2021-11-06 21:38:48,438 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 3816 transitions. Word has length 46 [2021-11-06 21:38:48,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:48,439 INFO L470 AbstractCegarLoop]: Abstraction has 2857 states and 3816 transitions. [2021-11-06 21:38:48,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:48,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3816 transitions. [2021-11-06 21:38:48,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 21:38:48,440 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:48,440 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] [2021-11-06 21:38:48,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 21:38:48,441 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:48,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:48,441 INFO L85 PathProgramCache]: Analyzing trace with hash -551432552, now seen corresponding path program 1 times [2021-11-06 21:38:48,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:48,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511882681] [2021-11-06 21:38:48,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:48,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:48,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:48,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511882681] [2021-11-06 21:38:48,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511882681] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:48,519 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:48,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:48,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484872122] [2021-11-06 21:38:48,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:48,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:48,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:48,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:48,521 INFO L87 Difference]: Start difference. First operand 2857 states and 3816 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:48,725 INFO L93 Difference]: Finished difference Result 2857 states and 3816 transitions. [2021-11-06 21:38:48,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:48,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2021-11-06 21:38:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:48,732 INFO L225 Difference]: With dead ends: 2857 [2021-11-06 21:38:48,732 INFO L226 Difference]: Without dead ends: 2853 [2021-11-06 21:38:48,733 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:48,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2021-11-06 21:38:48,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 2853. [2021-11-06 21:38:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2767 states have (on average 1.3393567040115648) internal successors, (3706), 2793 states have internal predecessors, (3706), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 3812 transitions. [2021-11-06 21:38:48,921 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 3812 transitions. Word has length 48 [2021-11-06 21:38:48,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:48,921 INFO L470 AbstractCegarLoop]: Abstraction has 2853 states and 3812 transitions. [2021-11-06 21:38:48,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 3812 transitions. [2021-11-06 21:38:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-06 21:38:48,923 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:48,923 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] [2021-11-06 21:38:48,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 21:38:48,923 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:48,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:48,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1645304292, now seen corresponding path program 1 times [2021-11-06 21:38:48,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:48,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369850195] [2021-11-06 21:38:48,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:48,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:49,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:49,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:49,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369850195] [2021-11-06 21:38:49,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369850195] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:49,006 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:49,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:49,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068000980] [2021-11-06 21:38:49,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:49,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:49,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:49,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:49,008 INFO L87 Difference]: Start difference. First operand 2853 states and 3812 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:49,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:49,272 INFO L93 Difference]: Finished difference Result 2853 states and 3812 transitions. [2021-11-06 21:38:49,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:49,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2021-11-06 21:38:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:49,278 INFO L225 Difference]: With dead ends: 2853 [2021-11-06 21:38:49,278 INFO L226 Difference]: Without dead ends: 2849 [2021-11-06 21:38:49,279 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:49,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2021-11-06 21:38:49,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2849. [2021-11-06 21:38:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2849 states, 2765 states have (on average 1.338878842676311) internal successors, (3702), 2789 states have internal predecessors, (3702), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2849 states and 3808 transitions. [2021-11-06 21:38:49,501 INFO L78 Accepts]: Start accepts. Automaton has 2849 states and 3808 transitions. Word has length 50 [2021-11-06 21:38:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:49,501 INFO L470 AbstractCegarLoop]: Abstraction has 2849 states and 3808 transitions. [2021-11-06 21:38:49,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:49,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 3808 transitions. [2021-11-06 21:38:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-06 21:38:49,502 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:49,502 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] [2021-11-06 21:38:49,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 21:38:49,503 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:49,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:49,503 INFO L85 PathProgramCache]: Analyzing trace with hash -589058560, now seen corresponding path program 1 times [2021-11-06 21:38:49,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:49,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444803352] [2021-11-06 21:38:49,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:49,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:49,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:49,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444803352] [2021-11-06 21:38:49,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444803352] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:49,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:49,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:49,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140002293] [2021-11-06 21:38:49,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:49,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:49,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:49,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:49,573 INFO L87 Difference]: Start difference. First operand 2849 states and 3808 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:49,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:49,797 INFO L93 Difference]: Finished difference Result 2849 states and 3808 transitions. [2021-11-06 21:38:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:49,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2021-11-06 21:38:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:49,806 INFO L225 Difference]: With dead ends: 2849 [2021-11-06 21:38:49,806 INFO L226 Difference]: Without dead ends: 2845 [2021-11-06 21:38:49,808 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2021-11-06 21:38:49,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2845. [2021-11-06 21:38:49,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2845 states, 2763 states have (on average 1.3384002895403546) internal successors, (3698), 2785 states have internal predecessors, (3698), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 3804 transitions. [2021-11-06 21:38:49,987 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 3804 transitions. Word has length 52 [2021-11-06 21:38:49,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:49,988 INFO L470 AbstractCegarLoop]: Abstraction has 2845 states and 3804 transitions. [2021-11-06 21:38:49,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:38:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 3804 transitions. [2021-11-06 21:38:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-06 21:38:49,989 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:49,989 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 21:38:49,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 21:38:49,990 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:49,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:49,990 INFO L85 PathProgramCache]: Analyzing trace with hash 850808388, now seen corresponding path program 1 times [2021-11-06 21:38:49,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:49,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288755370] [2021-11-06 21:38:49,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:49,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:50,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:50,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288755370] [2021-11-06 21:38:50,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288755370] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:50,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:50,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:50,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409973233] [2021-11-06 21:38:50,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:50,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:50,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:50,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:50,060 INFO L87 Difference]: Start difference. First operand 2845 states and 3804 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 21:38:50,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:50,264 INFO L93 Difference]: Finished difference Result 2845 states and 3804 transitions. [2021-11-06 21:38:50,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:50,265 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 21:38:50,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:50,271 INFO L225 Difference]: With dead ends: 2845 [2021-11-06 21:38:50,272 INFO L226 Difference]: Without dead ends: 2841 [2021-11-06 21:38:50,273 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:50,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2021-11-06 21:38:50,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2841. [2021-11-06 21:38:50,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2841 states, 2761 states have (on average 1.337921043100326) internal successors, (3694), 2781 states have internal predecessors, (3694), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 3800 transitions. [2021-11-06 21:38:50,541 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 3800 transitions. Word has length 54 [2021-11-06 21:38:50,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:50,542 INFO L470 AbstractCegarLoop]: Abstraction has 2841 states and 3800 transitions. [2021-11-06 21:38:50,542 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 21:38:50,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 3800 transitions. [2021-11-06 21:38:50,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 21:38:50,547 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:50,547 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:38:50,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 21:38:50,548 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:50,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:50,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1539510564, now seen corresponding path program 1 times [2021-11-06 21:38:50,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:50,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514708043] [2021-11-06 21:38:50,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:50,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:50,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:38:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:50,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:50,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:50,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514708043] [2021-11-06 21:38:50,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514708043] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:50,739 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:50,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:38:50,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675710088] [2021-11-06 21:38:50,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:50,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:50,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:50,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:50,741 INFO L87 Difference]: Start difference. First operand 2841 states and 3800 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:38:53,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:53,766 INFO L93 Difference]: Finished difference Result 5665 states and 7635 transitions. [2021-11-06 21:38:53,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:53,766 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2021-11-06 21:38:53,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:53,773 INFO L225 Difference]: With dead ends: 5665 [2021-11-06 21:38:53,773 INFO L226 Difference]: Without dead ends: 2843 [2021-11-06 21:38:53,783 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2021-11-06 21:38:53,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2843. [2021-11-06 21:38:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2843 states, 2763 states have (on average 1.3376764386536373) internal successors, (3696), 2783 states have internal predecessors, (3696), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2843 states and 3802 transitions. [2021-11-06 21:38:54,002 INFO L78 Accepts]: Start accepts. Automaton has 2843 states and 3802 transitions. Word has length 57 [2021-11-06 21:38:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:54,003 INFO L470 AbstractCegarLoop]: Abstraction has 2843 states and 3802 transitions. [2021-11-06 21:38:54,003 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:38:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2843 states and 3802 transitions. [2021-11-06 21:38:54,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-06 21:38:54,004 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:54,005 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 21:38:54,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 21:38:54,005 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:54,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:54,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1583476456, now seen corresponding path program 1 times [2021-11-06 21:38:54,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:54,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406225610] [2021-11-06 21:38:54,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:54,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:54,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:54,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406225610] [2021-11-06 21:38:54,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406225610] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:38:54,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:38:54,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:38:54,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121844365] [2021-11-06 21:38:54,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:38:54,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:54,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:38:54,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:38:54,087 INFO L87 Difference]: Start difference. First operand 2843 states and 3802 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 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 21:38:54,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:38:54,404 INFO L93 Difference]: Finished difference Result 2843 states and 3802 transitions. [2021-11-06 21:38:54,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:38:54,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 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 21:38:54,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:38:54,411 INFO L225 Difference]: With dead ends: 2843 [2021-11-06 21:38:54,411 INFO L226 Difference]: Without dead ends: 2839 [2021-11-06 21:38:54,412 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:38:54,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2021-11-06 21:38:54,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2839. [2021-11-06 21:38:54,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2839 states, 2761 states have (on average 1.3371966678739586) internal successors, (3692), 2779 states have internal predecessors, (3692), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:38:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 3798 transitions. [2021-11-06 21:38:54,627 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 3798 transitions. Word has length 56 [2021-11-06 21:38:54,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:38:54,627 INFO L470 AbstractCegarLoop]: Abstraction has 2839 states and 3798 transitions. [2021-11-06 21:38:54,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 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 21:38:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 3798 transitions. [2021-11-06 21:38:54,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 21:38:54,630 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:38:54,630 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:38:54,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 21:38:54,631 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:38:54,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:38:54,631 INFO L85 PathProgramCache]: Analyzing trace with hash -152677458, now seen corresponding path program 1 times [2021-11-06 21:38:54,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:38:54,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258368398] [2021-11-06 21:38:54,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:54,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:38:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:54,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:38:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:54,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:38:54,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258368398] [2021-11-06 21:38:54,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258368398] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:38:54,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789024473] [2021-11-06 21:38:54,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:38:54,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:38:54,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:38:54,826 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 21:38:54,827 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 21:38:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:38:56,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 1167 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-06 21:38:56,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:38:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:38:56,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789024473] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:38:56,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:38:56,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2021-11-06 21:38:56,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289950784] [2021-11-06 21:38:56,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 21:38:56,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:38:56,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 21:38:56,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 21:38:56,802 INFO L87 Difference]: Start difference. First operand 2839 states and 3798 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:39:00,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:39:00,107 INFO L93 Difference]: Finished difference Result 5661 states and 7631 transitions. [2021-11-06 21:39:00,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:39:00,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2021-11-06 21:39:00,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:39:00,114 INFO L225 Difference]: With dead ends: 5661 [2021-11-06 21:39:00,115 INFO L226 Difference]: Without dead ends: 2841 [2021-11-06 21:39:00,123 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 21:39:00,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2021-11-06 21:39:00,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2841. [2021-11-06 21:39:00,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2841 states, 2763 states have (on average 1.33695258776692) internal successors, (3694), 2781 states have internal predecessors, (3694), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:39:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 3800 transitions. [2021-11-06 21:39:00,336 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 3800 transitions. Word has length 58 [2021-11-06 21:39:00,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:39:00,336 INFO L470 AbstractCegarLoop]: Abstraction has 2841 states and 3800 transitions. [2021-11-06 21:39:00,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:39:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 3800 transitions. [2021-11-06 21:39:00,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 21:39:00,338 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:39:00,338 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:39:00,371 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 21:39:00,551 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,SelfDestructingSolverStorable25 [2021-11-06 21:39:00,552 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:39:00,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:39:00,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1070898588, now seen corresponding path program 2 times [2021-11-06 21:39:00,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:39:00,552 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834151485] [2021-11-06 21:39:00,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:39:00,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:39:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:39:00,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:39:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:39:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:39:00,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:39:00,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834151485] [2021-11-06 21:39:00,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834151485] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:39:00,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005221394] [2021-11-06 21:39:00,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 21:39:00,803 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:39:00,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:39:00,808 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 21:39:00,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-06 21:39:05,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 21:39:05,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 21:39:05,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 21:39:05,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:39:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:39:05,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005221394] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:39:05,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:39:05,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2021-11-06 21:39:05,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472558722] [2021-11-06 21:39:05,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 21:39:05,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:39:05,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 21:39:05,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-06 21:39:05,570 INFO L87 Difference]: Start difference. First operand 2841 states and 3800 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:39:09,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:39:09,056 INFO L93 Difference]: Finished difference Result 5665 states and 7635 transitions. [2021-11-06 21:39:09,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 21:39:09,056 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2021-11-06 21:39:09,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:39:09,066 INFO L225 Difference]: With dead ends: 5665 [2021-11-06 21:39:09,066 INFO L226 Difference]: Without dead ends: 2843 [2021-11-06 21:39:09,075 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-06 21:39:09,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2021-11-06 21:39:09,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2843. [2021-11-06 21:39:09,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2843 states, 2765 states have (on average 1.3367088607594937) internal successors, (3696), 2783 states have internal predecessors, (3696), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:39:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2843 states and 3802 transitions. [2021-11-06 21:39:09,370 INFO L78 Accepts]: Start accepts. Automaton has 2843 states and 3802 transitions. Word has length 59 [2021-11-06 21:39:09,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:39:09,370 INFO L470 AbstractCegarLoop]: Abstraction has 2843 states and 3802 transitions. [2021-11-06 21:39:09,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:39:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2843 states and 3802 transitions. [2021-11-06 21:39:09,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 21:39:09,372 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:39:09,372 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:39:09,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-06 21:39:09,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-06 21:39:09,587 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:39:09,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:39:09,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1302853612, now seen corresponding path program 1 times [2021-11-06 21:39:09,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:39:09,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522210276] [2021-11-06 21:39:09,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:39:09,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:39:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:39:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:39:09,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:39:09,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522210276] [2021-11-06 21:39:09,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522210276] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:39:09,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:39:09,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:39:09,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889434960] [2021-11-06 21:39:09,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:39:09,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:39:09,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:39:09,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:39:09,735 INFO L87 Difference]: Start difference. First operand 2843 states and 3802 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:39:10,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:39:10,034 INFO L93 Difference]: Finished difference Result 2843 states and 3802 transitions. [2021-11-06 21:39:10,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:39:10,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-06 21:39:10,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:39:10,040 INFO L225 Difference]: With dead ends: 2843 [2021-11-06 21:39:10,040 INFO L226 Difference]: Without dead ends: 2839 [2021-11-06 21:39:10,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 21:39:10,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2021-11-06 21:39:10,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2839. [2021-11-06 21:39:10,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2839 states, 2763 states have (on average 1.3362287368802026) internal successors, (3692), 2779 states have internal predecessors, (3692), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:39:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 3798 transitions. [2021-11-06 21:39:10,264 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 3798 transitions. Word has length 58 [2021-11-06 21:39:10,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:39:10,264 INFO L470 AbstractCegarLoop]: Abstraction has 2839 states and 3798 transitions. [2021-11-06 21:39:10,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:39:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 3798 transitions. [2021-11-06 21:39:10,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-06 21:39:10,266 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:39:10,266 INFO L513 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:39:10,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 21:39:10,266 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:39:10,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:39:10,267 INFO L85 PathProgramCache]: Analyzing trace with hash 529017454, now seen corresponding path program 3 times [2021-11-06 21:39:10,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:39:10,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867556425] [2021-11-06 21:39:10,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:39:10,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:39:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:39:10,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:39:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:39:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:39:10,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:39:10,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867556425] [2021-11-06 21:39:10,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867556425] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:39:10,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846629072] [2021-11-06 21:39:10,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-06 21:39:10,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:39:10,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:39:10,490 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:39:10,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-06 21:39:15,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-06 21:39:15,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 21:39:16,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-06 21:39:16,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:39:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:39:16,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846629072] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:39:16,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:39:16,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-11-06 21:39:16,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074587211] [2021-11-06 21:39:16,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 21:39:16,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:39:16,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 21:39:16,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-06 21:39:16,248 INFO L87 Difference]: Start difference. First operand 2839 states and 3798 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:39:19,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:39:19,680 INFO L93 Difference]: Finished difference Result 5661 states and 7631 transitions. [2021-11-06 21:39:19,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 21:39:19,681 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2021-11-06 21:39:19,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:39:19,686 INFO L225 Difference]: With dead ends: 5661 [2021-11-06 21:39:19,686 INFO L226 Difference]: Without dead ends: 2841 [2021-11-06 21:39:19,693 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-06 21:39:19,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2021-11-06 21:39:19,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2841. [2021-11-06 21:39:19,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2841 states, 2765 states have (on average 1.335985533453888) internal successors, (3694), 2781 states have internal predecessors, (3694), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:39:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 3800 transitions. [2021-11-06 21:39:19,921 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 3800 transitions. Word has length 60 [2021-11-06 21:39:19,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:39:19,921 INFO L470 AbstractCegarLoop]: Abstraction has 2841 states and 3800 transitions. [2021-11-06 21:39:19,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:39:19,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 3800 transitions. [2021-11-06 21:39:19,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 21:39:19,923 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:39:19,923 INFO L513 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:39:19,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-06 21:39:20,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-06 21:39:20,136 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:39:20,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:39:20,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1413192796, now seen corresponding path program 4 times [2021-11-06 21:39:20,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:39:20,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493298284] [2021-11-06 21:39:20,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:39:20,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:39:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:39:20,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:39:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:39:20,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:39:20,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:39:20,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493298284] [2021-11-06 21:39:20,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493298284] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:39:20,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498056389] [2021-11-06 21:39:20,393 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-06 21:39:20,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:39:20,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:39:20,394 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:39:20,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-06 21:39:23,002 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-06 21:39:23,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 21:39:23,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-06 21:39:23,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:39:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:39:23,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498056389] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:39:23,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:39:23,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-11-06 21:39:23,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805447044] [2021-11-06 21:39:23,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 21:39:23,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:39:23,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 21:39:23,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-06 21:39:23,283 INFO L87 Difference]: Start difference. First operand 2841 states and 3800 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:39:28,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:39:28,912 INFO L93 Difference]: Finished difference Result 5665 states and 7635 transitions. [2021-11-06 21:39:28,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 21:39:28,913 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2021-11-06 21:39:28,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:39:28,919 INFO L225 Difference]: With dead ends: 5665 [2021-11-06 21:39:28,919 INFO L226 Difference]: Without dead ends: 2843 [2021-11-06 21:39:28,927 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-06 21:39:28,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2021-11-06 21:39:29,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2843. [2021-11-06 21:39:29,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2843 states, 2767 states have (on average 1.335742681604626) internal successors, (3696), 2783 states have internal predecessors, (3696), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:39:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2843 states and 3802 transitions. [2021-11-06 21:39:29,100 INFO L78 Accepts]: Start accepts. Automaton has 2843 states and 3802 transitions. Word has length 61 [2021-11-06 21:39:29,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:39:29,100 INFO L470 AbstractCegarLoop]: Abstraction has 2843 states and 3802 transitions. [2021-11-06 21:39:29,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:39:29,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2843 states and 3802 transitions. [2021-11-06 21:39:29,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-06 21:39:29,102 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:39:29,102 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] [2021-11-06 21:39:29,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-06 21:39:29,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:39:29,315 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:39:29,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:39:29,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2087726768, now seen corresponding path program 1 times [2021-11-06 21:39:29,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:39:29,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906973667] [2021-11-06 21:39:29,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:39:29,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:39:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:39:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:39:29,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:39:29,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906973667] [2021-11-06 21:39:29,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906973667] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:39:29,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:39:29,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:39:29,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562039725] [2021-11-06 21:39:29,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:39:29,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:39:29,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:39:29,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:39:29,410 INFO L87 Difference]: Start difference. First operand 2843 states and 3802 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:39:29,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:39:29,655 INFO L93 Difference]: Finished difference Result 2843 states and 3802 transitions. [2021-11-06 21:39:29,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:39:29,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-06 21:39:29,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:39:29,658 INFO L225 Difference]: With dead ends: 2843 [2021-11-06 21:39:29,658 INFO L226 Difference]: Without dead ends: 2728 [2021-11-06 21:39:29,659 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:39:29,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2021-11-06 21:39:29,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 2728. [2021-11-06 21:39:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2728 states, 2654 states have (on average 1.348153730218538) internal successors, (3578), 2668 states have internal predecessors, (3578), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:39:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 3684 transitions. [2021-11-06 21:39:29,864 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 3684 transitions. Word has length 60 [2021-11-06 21:39:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:39:29,864 INFO L470 AbstractCegarLoop]: Abstraction has 2728 states and 3684 transitions. [2021-11-06 21:39:29,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:39:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 3684 transitions. [2021-11-06 21:39:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 21:39:29,865 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:39:29,866 INFO L513 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:39:29,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-06 21:39:29,866 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:39:29,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:39:29,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1492168402, now seen corresponding path program 5 times [2021-11-06 21:39:29,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:39:29,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750760800] [2021-11-06 21:39:29,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:39:29,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:39:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:39:30,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:39:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:39:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:39:30,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:39:30,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750760800] [2021-11-06 21:39:30,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750760800] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:39:30,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283262574] [2021-11-06 21:39:30,167 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-06 21:39:30,167 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:39:30,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:39:30,168 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:39:30,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-06 21:39:32,991 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-11-06 21:39:32,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 21:39:33,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-06 21:39:33,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:39:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:39:33,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283262574] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:39:33,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:39:33,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-11-06 21:39:33,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986468675] [2021-11-06 21:39:33,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 21:39:33,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:39:33,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 21:39:33,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-06 21:39:33,314 INFO L87 Difference]: Start difference. First operand 2728 states and 3684 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:39:36,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:39:36,412 INFO L93 Difference]: Finished difference Result 5441 states and 7407 transitions. [2021-11-06 21:39:36,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 21:39:36,413 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2021-11-06 21:39:36,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:39:36,419 INFO L225 Difference]: With dead ends: 5441 [2021-11-06 21:39:36,419 INFO L226 Difference]: Without dead ends: 2730 [2021-11-06 21:39:36,425 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-06 21:39:36,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2021-11-06 21:39:36,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 2730. [2021-11-06 21:39:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2730 states, 2656 states have (on average 1.3478915662650603) internal successors, (3580), 2670 states have internal predecessors, (3580), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:39:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 3686 transitions. [2021-11-06 21:39:36,604 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 3686 transitions. Word has length 62 [2021-11-06 21:39:36,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:39:36,604 INFO L470 AbstractCegarLoop]: Abstraction has 2730 states and 3686 transitions. [2021-11-06 21:39:36,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:39:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 3686 transitions. [2021-11-06 21:39:36,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-06 21:39:36,606 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:39:36,606 INFO L513 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:39:36,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-06 21:39:36,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:39:36,820 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:39:36,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:39:36,820 INFO L85 PathProgramCache]: Analyzing trace with hash 354555108, now seen corresponding path program 6 times [2021-11-06 21:39:36,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:39:36,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950593035] [2021-11-06 21:39:36,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:39:36,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:39:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:39:36,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:39:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:39:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:39:37,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:39:37,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950593035] [2021-11-06 21:39:37,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950593035] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:39:37,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145003000] [2021-11-06 21:39:37,154 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-06 21:39:37,154 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:39:37,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:39:37,156 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:39:37,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-06 21:39:46,964 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-11-06 21:39:46,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 21:39:46,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-06 21:39:47,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:39:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:39:47,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145003000] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:39:47,314 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:39:47,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-11-06 21:39:47,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092999814] [2021-11-06 21:39:47,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 21:39:47,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:39:47,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 21:39:47,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-11-06 21:39:47,315 INFO L87 Difference]: Start difference. First operand 2730 states and 3686 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:39:53,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:39:53,573 INFO L93 Difference]: Finished difference Result 5445 states and 7411 transitions. [2021-11-06 21:39:53,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 21:39:53,573 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2021-11-06 21:39:53,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:39:53,579 INFO L225 Difference]: With dead ends: 5445 [2021-11-06 21:39:53,579 INFO L226 Difference]: Without dead ends: 2732 [2021-11-06 21:39:53,586 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-11-06 21:39:53,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2021-11-06 21:39:53,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2732. [2021-11-06 21:39:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2732 states, 2658 states have (on average 1.347629796839729) internal successors, (3582), 2672 states have internal predecessors, (3582), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:39:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 3688 transitions. [2021-11-06 21:39:53,788 INFO L78 Accepts]: Start accepts. Automaton has 2732 states and 3688 transitions. Word has length 63 [2021-11-06 21:39:53,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:39:53,789 INFO L470 AbstractCegarLoop]: Abstraction has 2732 states and 3688 transitions. [2021-11-06 21:39:53,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:39:53,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 3688 transitions. [2021-11-06 21:39:53,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 21:39:53,790 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:39:53,790 INFO L513 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:39:53,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-06 21:39:53,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:39:53,996 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:39:53,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:39:53,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1768409070, now seen corresponding path program 7 times [2021-11-06 21:39:53,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:39:53,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077883525] [2021-11-06 21:39:53,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:39:53,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:39:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:39:54,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:39:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:39:54,353 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:39:54,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:39:54,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077883525] [2021-11-06 21:39:54,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077883525] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:39:54,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748101910] [2021-11-06 21:39:54,355 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-06 21:39:54,355 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:39:54,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:39:54,356 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:39:54,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-06 21:39:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:39:56,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-06 21:39:56,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:39:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:39:57,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748101910] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:39:57,195 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:39:57,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-11-06 21:39:57,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733400150] [2021-11-06 21:39:57,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-06 21:39:57,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:39:57,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-06 21:39:57,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-11-06 21:39:57,196 INFO L87 Difference]: Start difference. First operand 2732 states and 3688 transitions. Second operand has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 17 states have internal predecessors, (71), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:40:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:40:00,526 INFO L93 Difference]: Finished difference Result 5449 states and 7415 transitions. [2021-11-06 21:40:00,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 21:40:00,526 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 17 states have internal predecessors, (71), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2021-11-06 21:40:00,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:40:00,531 INFO L225 Difference]: With dead ends: 5449 [2021-11-06 21:40:00,531 INFO L226 Difference]: Without dead ends: 2734 [2021-11-06 21:40:00,539 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-11-06 21:40:00,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2734 states. [2021-11-06 21:40:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2734 to 2734. [2021-11-06 21:40:00,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2734 states, 2660 states have (on average 1.3473684210526315) internal successors, (3584), 2674 states have internal predecessors, (3584), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:40:00,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2734 states and 3690 transitions. [2021-11-06 21:40:00,694 INFO L78 Accepts]: Start accepts. Automaton has 2734 states and 3690 transitions. Word has length 64 [2021-11-06 21:40:00,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:40:00,694 INFO L470 AbstractCegarLoop]: Abstraction has 2734 states and 3690 transitions. [2021-11-06 21:40:00,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 17 states have internal predecessors, (71), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:40:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 3690 transitions. [2021-11-06 21:40:00,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-06 21:40:00,695 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:40:00,695 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:40:00,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-06 21:40:00,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:40:00,908 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:40:00,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:40:00,908 INFO L85 PathProgramCache]: Analyzing trace with hash -974766496, now seen corresponding path program 1 times [2021-11-06 21:40:00,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:40:00,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831568347] [2021-11-06 21:40:00,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:40:00,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:40:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:40:01,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:40:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:40:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:40:01,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:40:01,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831568347] [2021-11-06 21:40:01,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831568347] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:40:01,039 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:40:01,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 21:40:01,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095964113] [2021-11-06 21:40:01,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:40:01,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:40:01,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:40:01,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:40:01,041 INFO L87 Difference]: Start difference. First operand 2734 states and 3690 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:40:06,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:40:06,807 INFO L93 Difference]: Finished difference Result 5597 states and 7639 transitions. [2021-11-06 21:40:06,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:40:06,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2021-11-06 21:40:06,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:40:06,825 INFO L225 Difference]: With dead ends: 5597 [2021-11-06 21:40:06,826 INFO L226 Difference]: Without dead ends: 2880 [2021-11-06 21:40:06,834 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:40:06,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2021-11-06 21:40:07,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2738. [2021-11-06 21:40:07,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2738 states, 2664 states have (on average 1.3468468468468469) internal successors, (3588), 2678 states have internal predecessors, (3588), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:40:07,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 3694 transitions. [2021-11-06 21:40:07,060 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 3694 transitions. Word has length 65 [2021-11-06 21:40:07,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:40:07,060 INFO L470 AbstractCegarLoop]: Abstraction has 2738 states and 3694 transitions. [2021-11-06 21:40:07,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:40:07,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3694 transitions. [2021-11-06 21:40:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-06 21:40:07,062 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:40:07,062 INFO L513 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:40:07,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-06 21:40:07,063 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:40:07,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:40:07,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1646758364, now seen corresponding path program 8 times [2021-11-06 21:40:07,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:40:07,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910452702] [2021-11-06 21:40:07,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:40:07,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:40:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:40:07,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:40:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:40:07,502 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:40:07,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:40:07,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910452702] [2021-11-06 21:40:07,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910452702] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:40:07,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163672714] [2021-11-06 21:40:07,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 21:40:07,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:40:07,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:40:07,508 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:40:07,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-06 21:40:14,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 21:40:14,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 21:40:14,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-06 21:40:14,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:40:15,317 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:40:15,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163672714] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:40:15,317 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:40:15,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-11-06 21:40:15,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020605858] [2021-11-06 21:40:15,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-06 21:40:15,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:40:15,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-06 21:40:15,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2021-11-06 21:40:15,319 INFO L87 Difference]: Start difference. First operand 2738 states and 3694 transitions. Second operand has 20 states, 20 states have (on average 3.65) internal successors, (73), 19 states have internal predecessors, (73), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:40:18,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:40:18,823 INFO L93 Difference]: Finished difference Result 5461 states and 7427 transitions. [2021-11-06 21:40:18,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 21:40:18,824 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 19 states have internal predecessors, (73), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2021-11-06 21:40:18,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:40:18,831 INFO L225 Difference]: With dead ends: 5461 [2021-11-06 21:40:18,831 INFO L226 Difference]: Without dead ends: 2740 [2021-11-06 21:40:18,838 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2021-11-06 21:40:18,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2740 states. [2021-11-06 21:40:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2740 to 2740. [2021-11-06 21:40:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2740 states, 2666 states have (on average 1.3465866466616654) internal successors, (3590), 2680 states have internal predecessors, (3590), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:40:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 3696 transitions. [2021-11-06 21:40:19,010 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 3696 transitions. Word has length 65 [2021-11-06 21:40:19,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:40:19,010 INFO L470 AbstractCegarLoop]: Abstraction has 2740 states and 3696 transitions. [2021-11-06 21:40:19,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 19 states have internal predecessors, (73), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:40:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 3696 transitions. [2021-11-06 21:40:19,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-06 21:40:19,012 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:40:19,012 INFO L513 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:40:19,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-06 21:40:19,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-11-06 21:40:19,229 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:40:19,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:40:19,229 INFO L85 PathProgramCache]: Analyzing trace with hash -142766418, now seen corresponding path program 9 times [2021-11-06 21:40:19,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:40:19,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270155804] [2021-11-06 21:40:19,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:40:19,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:40:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:40:19,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:40:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:40:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:40:19,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:40:19,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270155804] [2021-11-06 21:40:19,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270155804] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:40:19,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829961015] [2021-11-06 21:40:19,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-06 21:40:19,646 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:40:19,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:40:19,647 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:40:19,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-06 21:40:29,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-11-06 21:40:29,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 21:40:29,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-06 21:40:29,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:40:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:40:30,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829961015] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:40:30,354 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:40:30,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2021-11-06 21:40:30,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387671497] [2021-11-06 21:40:30,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-06 21:40:30,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:40:30,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-06 21:40:30,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2021-11-06 21:40:30,355 INFO L87 Difference]: Start difference. First operand 2740 states and 3696 transitions. Second operand has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 21 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:40:35,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:40:35,268 INFO L93 Difference]: Finished difference Result 5465 states and 7431 transitions. [2021-11-06 21:40:35,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 21:40:35,269 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 21 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2021-11-06 21:40:35,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:40:35,274 INFO L225 Difference]: With dead ends: 5465 [2021-11-06 21:40:35,274 INFO L226 Difference]: Without dead ends: 2742 [2021-11-06 21:40:35,279 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2021-11-06 21:40:35,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2021-11-06 21:40:35,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2742. [2021-11-06 21:40:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2742 states, 2668 states have (on average 1.3463268365817092) internal successors, (3592), 2682 states have internal predecessors, (3592), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:40:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2742 states to 2742 states and 3698 transitions. [2021-11-06 21:40:35,489 INFO L78 Accepts]: Start accepts. Automaton has 2742 states and 3698 transitions. Word has length 66 [2021-11-06 21:40:35,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:40:35,490 INFO L470 AbstractCegarLoop]: Abstraction has 2742 states and 3698 transitions. [2021-11-06 21:40:35,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 21 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:40:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2742 states and 3698 transitions. [2021-11-06 21:40:35,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 21:40:35,491 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:40:35,491 INFO L513 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:40:35,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-06 21:40:35,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-11-06 21:40:35,692 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:40:35,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:40:35,692 INFO L85 PathProgramCache]: Analyzing trace with hash -763656348, now seen corresponding path program 10 times [2021-11-06 21:40:35,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:40:35,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369883638] [2021-11-06 21:40:35,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:40:35,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:40:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:40:35,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:40:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:40:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:40:36,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:40:36,160 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369883638] [2021-11-06 21:40:36,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369883638] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:40:36,160 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676322166] [2021-11-06 21:40:36,160 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-06 21:40:36,160 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:40:36,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:40:36,162 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:40:36,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-06 21:40:40,541 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-06 21:40:40,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 21:40:40,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-06 21:40:40,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:40:40,994 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:40:40,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676322166] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:40:40,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:40:40,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2021-11-06 21:40:40,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368955595] [2021-11-06 21:40:40,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-06 21:40:40,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:40:40,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-06 21:40:40,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2021-11-06 21:40:40,996 INFO L87 Difference]: Start difference. First operand 2742 states and 3698 transitions. Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 23 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:40:45,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:40:45,278 INFO L93 Difference]: Finished difference Result 5469 states and 7435 transitions. [2021-11-06 21:40:45,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 21:40:45,278 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 23 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2021-11-06 21:40:45,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:40:45,283 INFO L225 Difference]: With dead ends: 5469 [2021-11-06 21:40:45,284 INFO L226 Difference]: Without dead ends: 2744 [2021-11-06 21:40:45,288 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2021-11-06 21:40:45,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2021-11-06 21:40:45,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 2744. [2021-11-06 21:40:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2744 states, 2670 states have (on average 1.3460674157303372) internal successors, (3594), 2684 states have internal predecessors, (3594), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:40:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 3700 transitions. [2021-11-06 21:40:45,430 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 3700 transitions. Word has length 67 [2021-11-06 21:40:45,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:40:45,431 INFO L470 AbstractCegarLoop]: Abstraction has 2744 states and 3700 transitions. [2021-11-06 21:40:45,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 23 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:40:45,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 3700 transitions. [2021-11-06 21:40:45,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-06 21:40:45,433 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:40:45,433 INFO L513 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:40:45,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-06 21:40:45,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-11-06 21:40:45,651 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:40:45,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:40:45,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1463592302, now seen corresponding path program 11 times [2021-11-06 21:40:45,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:40:45,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812608446] [2021-11-06 21:40:45,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:40:45,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:40:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:40:45,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:40:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:40:46,164 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:40:46,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:40:46,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812608446] [2021-11-06 21:40:46,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812608446] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:40:46,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908656355] [2021-11-06 21:40:46,165 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-06 21:40:46,165 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:40:46,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:40:46,168 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:40:46,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-06 21:40:51,230 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-11-06 21:40:51,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 21:40:51,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-06 21:40:51,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:40:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:40:51,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908656355] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:40:51,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:40:51,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2021-11-06 21:40:51,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229187044] [2021-11-06 21:40:51,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-06 21:40:51,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:40:51,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-06 21:40:51,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2021-11-06 21:40:51,768 INFO L87 Difference]: Start difference. First operand 2744 states and 3700 transitions. Second operand has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:40:57,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:40:57,373 INFO L93 Difference]: Finished difference Result 5473 states and 7439 transitions. [2021-11-06 21:40:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-06 21:40:57,373 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2021-11-06 21:40:57,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:40:57,379 INFO L225 Difference]: With dead ends: 5473 [2021-11-06 21:40:57,379 INFO L226 Difference]: Without dead ends: 2746 [2021-11-06 21:40:57,384 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2021-11-06 21:40:57,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2021-11-06 21:40:57,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2746. [2021-11-06 21:40:57,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2746 states, 2672 states have (on average 1.345808383233533) internal successors, (3596), 2686 states have internal predecessors, (3596), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:40:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 3702 transitions. [2021-11-06 21:40:57,587 INFO L78 Accepts]: Start accepts. Automaton has 2746 states and 3702 transitions. Word has length 68 [2021-11-06 21:40:57,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:40:57,587 INFO L470 AbstractCegarLoop]: Abstraction has 2746 states and 3702 transitions. [2021-11-06 21:40:57,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:40:57,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 3702 transitions. [2021-11-06 21:40:57,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 21:40:57,589 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:40:57,589 INFO L513 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:40:57,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-06 21:40:57,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-11-06 21:40:57,791 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:40:57,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:40:57,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1788823716, now seen corresponding path program 12 times [2021-11-06 21:40:57,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:40:57,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380325264] [2021-11-06 21:40:57,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:40:57,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:40:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:40:57,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:40:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:40:58,347 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:40:58,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:40:58,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380325264] [2021-11-06 21:40:58,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380325264] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:40:58,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513782702] [2021-11-06 21:40:58,348 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-06 21:40:58,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:40:58,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:40:58,350 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:40:58,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-06 21:41:15,764 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-11-06 21:41:15,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 21:41:15,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-06 21:41:15,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:41:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:41:16,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513782702] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:41:16,327 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:41:16,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2021-11-06 21:41:16,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038693351] [2021-11-06 21:41:16,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-06 21:41:16,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:41:16,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-06 21:41:16,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2021-11-06 21:41:16,328 INFO L87 Difference]: Start difference. First operand 2746 states and 3702 transitions. Second operand has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 27 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:41:20,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:41:20,546 INFO L93 Difference]: Finished difference Result 5477 states and 7443 transitions. [2021-11-06 21:41:20,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 21:41:20,546 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 27 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2021-11-06 21:41:20,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:41:20,552 INFO L225 Difference]: With dead ends: 5477 [2021-11-06 21:41:20,552 INFO L226 Difference]: Without dead ends: 2748 [2021-11-06 21:41:20,556 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2021-11-06 21:41:20,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states. [2021-11-06 21:41:20,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 2748. [2021-11-06 21:41:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2748 states, 2674 states have (on average 1.3455497382198953) internal successors, (3598), 2688 states have internal predecessors, (3598), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:41:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2748 states and 3704 transitions. [2021-11-06 21:41:20,699 INFO L78 Accepts]: Start accepts. Automaton has 2748 states and 3704 transitions. Word has length 69 [2021-11-06 21:41:20,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:41:20,700 INFO L470 AbstractCegarLoop]: Abstraction has 2748 states and 3704 transitions. [2021-11-06 21:41:20,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 27 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:41:20,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 3704 transitions. [2021-11-06 21:41:20,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-06 21:41:20,701 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:41:20,702 INFO L513 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:41:20,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-06 21:41:20,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-11-06 21:41:20,922 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:41:20,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:41:20,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1013904338, now seen corresponding path program 13 times [2021-11-06 21:41:20,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:41:20,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634041726] [2021-11-06 21:41:20,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:41:20,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:41:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:41:21,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:41:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:41:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:41:21,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:41:21,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634041726] [2021-11-06 21:41:21,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634041726] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:41:21,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347323992] [2021-11-06 21:41:21,539 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-06 21:41:21,540 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:41:21,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:41:21,541 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:41:21,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-06 21:41:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:41:24,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 1239 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-06 21:41:24,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:41:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:41:25,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347323992] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:41:25,200 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:41:25,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2021-11-06 21:41:25,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226265952] [2021-11-06 21:41:25,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-06 21:41:25,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:41:25,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-06 21:41:25,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2021-11-06 21:41:25,201 INFO L87 Difference]: Start difference. First operand 2748 states and 3704 transitions. Second operand has 30 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 29 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:41:29,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:41:29,698 INFO L93 Difference]: Finished difference Result 5481 states and 7447 transitions. [2021-11-06 21:41:29,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-06 21:41:29,698 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 29 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2021-11-06 21:41:29,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:41:29,703 INFO L225 Difference]: With dead ends: 5481 [2021-11-06 21:41:29,703 INFO L226 Difference]: Without dead ends: 2750 [2021-11-06 21:41:29,706 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2021-11-06 21:41:29,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2021-11-06 21:41:29,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2750. [2021-11-06 21:41:29,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2750 states, 2676 states have (on average 1.345291479820628) internal successors, (3600), 2690 states have internal predecessors, (3600), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:41:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 3706 transitions. [2021-11-06 21:41:29,877 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 3706 transitions. Word has length 70 [2021-11-06 21:41:29,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:41:29,877 INFO L470 AbstractCegarLoop]: Abstraction has 2750 states and 3706 transitions. [2021-11-06 21:41:29,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 29 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:41:29,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3706 transitions. [2021-11-06 21:41:29,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 21:41:29,878 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:41:29,879 INFO L513 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:41:29,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-06 21:41:30,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2021-11-06 21:41:30,088 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:41:30,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:41:30,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1999128092, now seen corresponding path program 14 times [2021-11-06 21:41:30,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:41:30,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983534930] [2021-11-06 21:41:30,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:41:30,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:41:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:41:30,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:41:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:41:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:41:30,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:41:30,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983534930] [2021-11-06 21:41:30,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983534930] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:41:30,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133790465] [2021-11-06 21:41:30,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 21:41:30,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:41:30,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:41:30,786 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:41:30,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-06 21:41:36,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 21:41:36,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 21:41:36,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 1245 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-06 21:41:36,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:41:36,793 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:41:36,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133790465] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:41:36,794 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:41:36,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2021-11-06 21:41:36,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208638701] [2021-11-06 21:41:36,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-06 21:41:36,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:41:36,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-06 21:41:36,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2021-11-06 21:41:36,795 INFO L87 Difference]: Start difference. First operand 2750 states and 3706 transitions. Second operand has 32 states, 32 states have (on average 2.65625) internal successors, (85), 31 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:41:40,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:41:40,566 INFO L93 Difference]: Finished difference Result 5485 states and 7451 transitions. [2021-11-06 21:41:40,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-06 21:41:40,566 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.65625) internal successors, (85), 31 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2021-11-06 21:41:40,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:41:40,574 INFO L225 Difference]: With dead ends: 5485 [2021-11-06 21:41:40,574 INFO L226 Difference]: Without dead ends: 2752 [2021-11-06 21:41:40,581 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2021-11-06 21:41:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2021-11-06 21:41:40,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2752. [2021-11-06 21:41:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2752 states, 2678 states have (on average 1.3450336071695295) internal successors, (3602), 2692 states have internal predecessors, (3602), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:41:40,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2752 states to 2752 states and 3708 transitions. [2021-11-06 21:41:40,794 INFO L78 Accepts]: Start accepts. Automaton has 2752 states and 3708 transitions. Word has length 71 [2021-11-06 21:41:40,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:41:40,795 INFO L470 AbstractCegarLoop]: Abstraction has 2752 states and 3708 transitions. [2021-11-06 21:41:40,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.65625) internal successors, (85), 31 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:41:40,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2752 states and 3708 transitions. [2021-11-06 21:41:40,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 21:41:40,798 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:41:40,798 INFO L513 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:41:40,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-06 21:41:41,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:41:41,012 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:41:41,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:41:41,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1818673902, now seen corresponding path program 15 times [2021-11-06 21:41:41,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:41:41,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806302128] [2021-11-06 21:41:41,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:41:41,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:41:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:41:41,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:41:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:41:41,704 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:41:41,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:41:41,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806302128] [2021-11-06 21:41:41,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806302128] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:41:41,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926267953] [2021-11-06 21:41:41,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-06 21:41:41,705 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:41:41,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:41:41,706 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:41:41,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-06 21:43:05,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2021-11-06 21:43:05,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 21:43:05,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-06 21:43:05,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:43:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:43:06,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926267953] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:43:06,455 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:43:06,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2021-11-06 21:43:06,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477328368] [2021-11-06 21:43:06,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-06 21:43:06,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:43:06,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-06 21:43:06,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2021-11-06 21:43:06,456 INFO L87 Difference]: Start difference. First operand 2752 states and 3708 transitions. Second operand has 34 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 33 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:43:11,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:43:11,651 INFO L93 Difference]: Finished difference Result 5489 states and 7455 transitions. [2021-11-06 21:43:11,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 21:43:11,652 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 33 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2021-11-06 21:43:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:43:11,659 INFO L225 Difference]: With dead ends: 5489 [2021-11-06 21:43:11,659 INFO L226 Difference]: Without dead ends: 2754 [2021-11-06 21:43:11,667 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2021-11-06 21:43:11,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2021-11-06 21:43:11,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2754. [2021-11-06 21:43:11,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2754 states, 2680 states have (on average 1.344776119402985) internal successors, (3604), 2694 states have internal predecessors, (3604), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:43:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2754 states to 2754 states and 3710 transitions. [2021-11-06 21:43:11,877 INFO L78 Accepts]: Start accepts. Automaton has 2754 states and 3710 transitions. Word has length 72 [2021-11-06 21:43:11,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:43:11,879 INFO L470 AbstractCegarLoop]: Abstraction has 2754 states and 3710 transitions. [2021-11-06 21:43:11,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 33 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:43:11,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2754 states and 3710 transitions. [2021-11-06 21:43:11,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-06 21:43:11,881 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:43:11,881 INFO L513 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:43:11,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-06 21:43:12,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:43:12,109 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:43:12,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:43:12,109 INFO L85 PathProgramCache]: Analyzing trace with hash -88548572, now seen corresponding path program 16 times [2021-11-06 21:43:12,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:43:12,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679036872] [2021-11-06 21:43:12,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:43:12,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:43:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:43:12,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:43:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:43:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:43:12,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:43:12,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679036872] [2021-11-06 21:43:12,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679036872] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:43:12,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923159612] [2021-11-06 21:43:12,942 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-06 21:43:12,942 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:43:12,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:43:12,943 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:43:12,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-06 21:43:16,950 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-06 21:43:16,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 21:43:16,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 1257 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-06 21:43:16,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:43:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:43:17,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923159612] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:43:17,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:43:17,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2021-11-06 21:43:17,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858573475] [2021-11-06 21:43:17,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-06 21:43:17,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:43:17,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-06 21:43:17,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1144, Unknown=0, NotChecked=0, Total=1260 [2021-11-06 21:43:17,866 INFO L87 Difference]: Start difference. First operand 2754 states and 3710 transitions. Second operand has 36 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 35 states have internal predecessors, (89), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:43:22,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:43:22,404 INFO L93 Difference]: Finished difference Result 5493 states and 7459 transitions. [2021-11-06 21:43:22,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-06 21:43:22,404 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 35 states have internal predecessors, (89), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2021-11-06 21:43:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:43:22,410 INFO L225 Difference]: With dead ends: 5493 [2021-11-06 21:43:22,410 INFO L226 Difference]: Without dead ends: 2756 [2021-11-06 21:43:22,416 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=116, Invalid=1144, Unknown=0, NotChecked=0, Total=1260 [2021-11-06 21:43:22,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2756 states. [2021-11-06 21:43:22,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2756 to 2756. [2021-11-06 21:43:22,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2756 states, 2682 states have (on average 1.3445190156599554) internal successors, (3606), 2696 states have internal predecessors, (3606), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:43:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 3712 transitions. [2021-11-06 21:43:22,563 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 3712 transitions. Word has length 73 [2021-11-06 21:43:22,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:43:22,564 INFO L470 AbstractCegarLoop]: Abstraction has 2756 states and 3712 transitions. [2021-11-06 21:43:22,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 35 states have internal predecessors, (89), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:43:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3712 transitions. [2021-11-06 21:43:22,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-06 21:43:22,565 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:43:22,565 INFO L513 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:43:22,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-06 21:43:22,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-11-06 21:43:22,766 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:43:22,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:43:22,767 INFO L85 PathProgramCache]: Analyzing trace with hash 917096878, now seen corresponding path program 17 times [2021-11-06 21:43:22,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:43:22,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210545672] [2021-11-06 21:43:22,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:43:22,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:43:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:43:22,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:43:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:43:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:43:23,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:43:23,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210545672] [2021-11-06 21:43:23,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210545672] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:43:23,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205899936] [2021-11-06 21:43:23,672 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-06 21:43:23,672 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:43:23,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:43:23,673 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:43:23,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-06 21:45:24,481 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2021-11-06 21:45:24,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 21:45:24,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-06 21:45:24,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:45:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:45:25,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205899936] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:45:25,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:45:25,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2021-11-06 21:45:25,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689344402] [2021-11-06 21:45:25,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-06 21:45:25,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:45:25,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-06 21:45:25,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2021-11-06 21:45:25,439 INFO L87 Difference]: Start difference. First operand 2756 states and 3712 transitions. Second operand has 38 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 37 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:45:31,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:45:31,575 INFO L93 Difference]: Finished difference Result 5497 states and 7463 transitions. [2021-11-06 21:45:31,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-06 21:45:31,575 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 37 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2021-11-06 21:45:31,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:45:31,581 INFO L225 Difference]: With dead ends: 5497 [2021-11-06 21:45:31,581 INFO L226 Difference]: Without dead ends: 2758 [2021-11-06 21:45:31,586 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2021-11-06 21:45:31,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2021-11-06 21:45:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2758. [2021-11-06 21:45:31,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2758 states, 2684 states have (on average 1.3442622950819672) internal successors, (3608), 2698 states have internal predecessors, (3608), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:45:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2758 states to 2758 states and 3714 transitions. [2021-11-06 21:45:31,720 INFO L78 Accepts]: Start accepts. Automaton has 2758 states and 3714 transitions. Word has length 74 [2021-11-06 21:45:31,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:45:31,720 INFO L470 AbstractCegarLoop]: Abstraction has 2758 states and 3714 transitions. [2021-11-06 21:45:31,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 37 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:45:31,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2758 states and 3714 transitions. [2021-11-06 21:45:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 21:45:31,722 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:45:31,722 INFO L513 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:45:31,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-06 21:45:31,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:45:31,936 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:45:31,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:45:31,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2027334756, now seen corresponding path program 18 times [2021-11-06 21:45:31,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:45:31,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172237180] [2021-11-06 21:45:31,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:45:31,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:45:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:45:32,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:45:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:45:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:45:32,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:45:32,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172237180] [2021-11-06 21:45:32,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172237180] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:45:32,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205040112] [2021-11-06 21:45:32,790 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-06 21:45:32,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:45:32,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:45:32,791 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:45:32,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-06 21:46:21,551 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2021-11-06 21:46:21,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 21:46:21,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 1269 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-06 21:46:21,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:46:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:46:22,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205040112] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:46:22,784 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:46:22,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 40 [2021-11-06 21:46:22,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463306857] [2021-11-06 21:46:22,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-06 21:46:22,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:46:22,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-06 21:46:22,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1430, Unknown=0, NotChecked=0, Total=1560 [2021-11-06 21:46:22,785 INFO L87 Difference]: Start difference. First operand 2758 states and 3714 transitions. Second operand has 40 states, 40 states have (on average 2.325) internal successors, (93), 39 states have internal predecessors, (93), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:46:27,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:46:27,477 INFO L93 Difference]: Finished difference Result 5501 states and 7467 transitions. [2021-11-06 21:46:27,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-06 21:46:27,478 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.325) internal successors, (93), 39 states have internal predecessors, (93), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2021-11-06 21:46:27,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:46:27,483 INFO L225 Difference]: With dead ends: 5501 [2021-11-06 21:46:27,483 INFO L226 Difference]: Without dead ends: 2760 [2021-11-06 21:46:27,488 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=130, Invalid=1430, Unknown=0, NotChecked=0, Total=1560 [2021-11-06 21:46:27,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2021-11-06 21:46:27,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2760. [2021-11-06 21:46:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2760 states, 2686 states have (on average 1.344005956813105) internal successors, (3610), 2700 states have internal predecessors, (3610), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:46:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 3716 transitions. [2021-11-06 21:46:27,643 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 3716 transitions. Word has length 75 [2021-11-06 21:46:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:46:27,643 INFO L470 AbstractCegarLoop]: Abstraction has 2760 states and 3716 transitions. [2021-11-06 21:46:27,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.325) internal successors, (93), 39 states have internal predecessors, (93), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:46:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 3716 transitions. [2021-11-06 21:46:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-06 21:46:27,644 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:46:27,644 INFO L513 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:46:27,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-11-06 21:46:27,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:46:27,845 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:46:27,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:46:27,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2084970606, now seen corresponding path program 19 times [2021-11-06 21:46:27,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:46:27,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237433023] [2021-11-06 21:46:27,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:46:27,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:46:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:46:27,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:46:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:46:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:46:28,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:46:28,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237433023] [2021-11-06 21:46:28,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237433023] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:46:28,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390005767] [2021-11-06 21:46:28,949 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-06 21:46:28,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:46:28,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:46:28,950 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:46:28,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-06 21:46:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:46:34,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 43 conjunts are in the unsatisfiable core [2021-11-06 21:46:34,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:46:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:46:35,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390005767] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:46:35,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:46:35,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2021-11-06 21:46:35,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504862437] [2021-11-06 21:46:35,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-06 21:46:35,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:46:35,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-06 21:46:35,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1585, Unknown=0, NotChecked=0, Total=1722 [2021-11-06 21:46:35,682 INFO L87 Difference]: Start difference. First operand 2760 states and 3716 transitions. Second operand has 42 states, 42 states have (on average 2.261904761904762) internal successors, (95), 41 states have internal predecessors, (95), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:46:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:46:41,299 INFO L93 Difference]: Finished difference Result 5505 states and 7471 transitions. [2021-11-06 21:46:41,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-06 21:46:41,300 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.261904761904762) internal successors, (95), 41 states have internal predecessors, (95), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2021-11-06 21:46:41,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:46:41,305 INFO L225 Difference]: With dead ends: 5505 [2021-11-06 21:46:41,305 INFO L226 Difference]: Without dead ends: 2762 [2021-11-06 21:46:41,310 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=137, Invalid=1585, Unknown=0, NotChecked=0, Total=1722 [2021-11-06 21:46:41,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2021-11-06 21:46:41,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2762. [2021-11-06 21:46:41,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2762 states, 2688 states have (on average 1.34375) internal successors, (3612), 2702 states have internal predecessors, (3612), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:46:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 3718 transitions. [2021-11-06 21:46:41,454 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 3718 transitions. Word has length 76 [2021-11-06 21:46:41,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:46:41,455 INFO L470 AbstractCegarLoop]: Abstraction has 2762 states and 3718 transitions. [2021-11-06 21:46:41,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.261904761904762) internal successors, (95), 41 states have internal predecessors, (95), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:46:41,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 3718 transitions. [2021-11-06 21:46:41,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-06 21:46:41,456 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:46:41,457 INFO L513 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:46:41,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-06 21:46:41,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:46:41,658 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:46:41,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:46:41,658 INFO L85 PathProgramCache]: Analyzing trace with hash -423285340, now seen corresponding path program 20 times [2021-11-06 21:46:41,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:46:41,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529948574] [2021-11-06 21:46:41,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:46:41,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:46:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:46:41,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:46:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:46:42,992 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:46:42,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:46:42,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529948574] [2021-11-06 21:46:42,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529948574] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:46:42,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804711822] [2021-11-06 21:46:42,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 21:46:42,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:46:42,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:46:42,993 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:46:42,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-06 21:46:50,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 21:46:50,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 21:46:50,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-06 21:46:50,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:46:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:46:52,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804711822] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:46:52,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:46:52,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2021-11-06 21:46:52,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635308828] [2021-11-06 21:46:52,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-06 21:46:52,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:46:52,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-06 21:46:52,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1748, Unknown=0, NotChecked=0, Total=1892 [2021-11-06 21:46:52,460 INFO L87 Difference]: Start difference. First operand 2762 states and 3718 transitions. Second operand has 44 states, 44 states have (on average 2.2045454545454546) internal successors, (97), 43 states have internal predecessors, (97), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:46:58,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:46:58,218 INFO L93 Difference]: Finished difference Result 5509 states and 7475 transitions. [2021-11-06 21:46:58,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-06 21:46:58,218 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.2045454545454546) internal successors, (97), 43 states have internal predecessors, (97), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2021-11-06 21:46:58,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:46:58,223 INFO L225 Difference]: With dead ends: 5509 [2021-11-06 21:46:58,223 INFO L226 Difference]: Without dead ends: 2764 [2021-11-06 21:46:58,230 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=144, Invalid=1748, Unknown=0, NotChecked=0, Total=1892 [2021-11-06 21:46:58,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2021-11-06 21:46:58,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2021-11-06 21:46:58,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2690 states have (on average 1.3434944237918216) internal successors, (3614), 2704 states have internal predecessors, (3614), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-11-06 21:46:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3720 transitions. [2021-11-06 21:46:58,374 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3720 transitions. Word has length 77 [2021-11-06 21:46:58,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:46:58,374 INFO L470 AbstractCegarLoop]: Abstraction has 2764 states and 3720 transitions. [2021-11-06 21:46:58,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.2045454545454546) internal successors, (97), 43 states have internal predecessors, (97), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:46:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3720 transitions. [2021-11-06 21:46:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-06 21:46:58,375 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:46:58,376 INFO L513 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:46:58,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-06 21:46:58,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-11-06 21:46:58,576 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 82 more)] === [2021-11-06 21:46:58,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:46:58,577 INFO L85 PathProgramCache]: Analyzing trace with hash -869808338, now seen corresponding path program 21 times [2021-11-06 21:46:58,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:46:58,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651128724] [2021-11-06 21:46:58,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:46:58,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:46:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:46:58,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-06 21:46:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:47:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:47:00,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:47:00,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651128724] [2021-11-06 21:47:00,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651128724] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:47:00,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750896302] [2021-11-06 21:47:00,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-06 21:47:00,265 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:47:00,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:47:00,266 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:47:00,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process Killed by 15