./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5f08f0f0 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---net--netfilter--nfnetlink_log.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 13180db7de3a8489ee06ea96825d5be5d06449dd3c867f58676a7914255b860c --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-05 23:58:10,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-05 23:58:10,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-05 23:58:10,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-05 23:58:10,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-05 23:58:10,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-05 23:58:10,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-05 23:58:10,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-05 23:58:10,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-05 23:58:10,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-05 23:58:10,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-05 23:58:10,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-05 23:58:10,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-05 23:58:10,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-05 23:58:10,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-05 23:58:10,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-05 23:58:10,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-05 23:58:10,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-05 23:58:10,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-05 23:58:10,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-05 23:58:10,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-05 23:58:10,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-05 23:58:10,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-05 23:58:10,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-05 23:58:10,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-05 23:58:10,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-05 23:58:10,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-05 23:58:10,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-05 23:58:10,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-05 23:58:10,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-05 23:58:10,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-05 23:58:10,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-05 23:58:10,990 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-05 23:58:10,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-05 23:58:10,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-05 23:58:10,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-05 23:58:10,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-05 23:58:10,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-05 23:58:10,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-05 23:58:10,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-05 23:58:10,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-05 23:58:10,998 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-05 23:58:11,033 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-05 23:58:11,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-05 23:58:11,035 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-05 23:58:11,035 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-05 23:58:11,037 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-05 23:58:11,037 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-05 23:58:11,037 INFO L138 SettingsManager]: * Use SBE=true [2021-11-05 23:58:11,037 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-05 23:58:11,038 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-05 23:58:11,038 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-05 23:58:11,038 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-05 23:58:11,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-05 23:58:11,039 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-05 23:58:11,039 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-05 23:58:11,039 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-05 23:58:11,039 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-05 23:58:11,040 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-05 23:58:11,040 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-05 23:58:11,040 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-05 23:58:11,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 23:58:11,040 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-05 23:58:11,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-05 23:58:11,041 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-05 23:58:11,041 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-05 23:58:11,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-05 23:58:11,048 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-05 23:58:11,048 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-05 23:58:11,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-05 23:58:11,048 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-05 23:58:11,048 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 -> 13180db7de3a8489ee06ea96825d5be5d06449dd3c867f58676a7914255b860c [2021-11-05 23:58:11,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-05 23:58:11,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-05 23:58:11,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-05 23:58:11,390 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-05 23:58:11,391 INFO L275 PluginConnector]: CDTParser initialized [2021-11-05 23:58:11,393 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---net--netfilter--nfnetlink_log.ko.cil.i [2021-11-05 23:58:11,454 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2294eca1b/2761b51b41cd4050b7bbafd1f483a4c8/FLAG3baf0710d [2021-11-05 23:58:12,215 INFO L306 CDTParser]: Found 1 translation units. [2021-11-05 23:58:12,216 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2021-11-05 23:58:12,276 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2294eca1b/2761b51b41cd4050b7bbafd1f483a4c8/FLAG3baf0710d [2021-11-05 23:58:12,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2294eca1b/2761b51b41cd4050b7bbafd1f483a4c8 [2021-11-05 23:58:12,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-05 23:58:12,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-05 23:58:12,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-05 23:58:12,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-05 23:58:12,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-05 23:58:12,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:58:12" (1/1) ... [2021-11-05 23:58:12,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@420d246a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:58:12, skipping insertion in model container [2021-11-05 23:58:12,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:58:12" (1/1) ... [2021-11-05 23:58:12,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-05 23:58:12,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[400642,400655] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[400787,400800] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[400933,400946] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[401098,401111] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[401256,401269] [2021-11-05 23:58:16,189 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401414,401427] [2021-11-05 23:58:16,190 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401572,401585] [2021-11-05 23:58:16,190 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401732,401745] [2021-11-05 23:58:16,191 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401891,401904] [2021-11-05 23:58:16,191 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402030,402043] [2021-11-05 23:58:16,192 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402172,402185] [2021-11-05 23:58:16,192 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402321,402334] [2021-11-05 23:58:16,193 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402460,402473] [2021-11-05 23:58:16,193 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402615,402628] [2021-11-05 23:58:16,193 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402775,402788] [2021-11-05 23:58:16,194 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402926,402939] [2021-11-05 23:58:16,194 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403077,403090] [2021-11-05 23:58:16,195 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403229,403242] [2021-11-05 23:58:16,196 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403378,403391] [2021-11-05 23:58:16,196 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403526,403539] [2021-11-05 23:58:16,198 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403683,403696] [2021-11-05 23:58:16,198 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403832,403845] [2021-11-05 23:58:16,199 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403988,404001] [2021-11-05 23:58:16,199 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404141,404154] [2021-11-05 23:58:16,200 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404287,404300] [2021-11-05 23:58:16,201 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404430,404443] [2021-11-05 23:58:16,202 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404582,404595] [2021-11-05 23:58:16,203 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404728,404741] [2021-11-05 23:58:16,203 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404873,404886] [2021-11-05 23:58:16,204 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405027,405040] [2021-11-05 23:58:16,205 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405178,405191] [2021-11-05 23:58:16,205 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405333,405346] [2021-11-05 23:58:16,206 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405485,405498] [2021-11-05 23:58:16,206 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405640,405653] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[405804,405817] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[405960,405973] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[406124,406137] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[406266,406279] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[406424,406437] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[406591,406604] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[406750,406763] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[406909,406922] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[407058,407071] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[407205,407218] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[407344,407357] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[407507,407520] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[407673,407686] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[407837,407850] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[408002,408015] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[408167,408180] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[408333,408346] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[408498,408511] [2021-11-05 23:58:16,216 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408665,408678] [2021-11-05 23:58:16,216 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408825,408838] [2021-11-05 23:58:16,216 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408987,409000] [2021-11-05 23:58:16,217 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409146,409159] [2021-11-05 23:58:16,217 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409292,409305] [2021-11-05 23:58:16,218 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409435,409448] [2021-11-05 23:58:16,218 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409579,409592] [2021-11-05 23:58:16,218 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409722,409735] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[409866,409879] [2021-11-05 23:58:16,220 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410007,410020] [2021-11-05 23:58:16,220 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410145,410158] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[410303,410316] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[410462,410475] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[410618,410631] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[410767,410780] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[410919,410932] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[411070,411083] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[411219,411232] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[411371,411384] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[411519,411532] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[411672,411685] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[411823,411836] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[411973,411986] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[412120,412133] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[412271,412284] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[412422,412435] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[412570,412583] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[412736,412749] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[412905,412918] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[413072,413085] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[413240,413253] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[413390,413403] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[413537,413550] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[413698,413711] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[413868,413881] [2021-11-05 23:58:16,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---net--netfilter--nfnetlink_log.ko.cil.i[414030,414043] [2021-11-05 23:58:16,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 23:58:16,276 INFO L203 MainTranslator]: Completed pre-run [2021-11-05 23:58:16,548 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400642,400655] [2021-11-05 23:58:16,549 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400787,400800] [2021-11-05 23:58:16,549 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400933,400946] [2021-11-05 23:58:16,550 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401098,401111] [2021-11-05 23:58:16,550 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401256,401269] [2021-11-05 23:58:16,551 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401414,401427] [2021-11-05 23:58:16,551 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401572,401585] [2021-11-05 23:58:16,551 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401732,401745] [2021-11-05 23:58:16,552 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401891,401904] [2021-11-05 23:58:16,552 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402030,402043] [2021-11-05 23:58:16,552 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402172,402185] [2021-11-05 23:58:16,553 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402321,402334] [2021-11-05 23:58:16,553 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402460,402473] [2021-11-05 23:58:16,553 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402615,402628] [2021-11-05 23:58:16,554 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402775,402788] [2021-11-05 23:58:16,554 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402926,402939] [2021-11-05 23:58:16,554 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403077,403090] [2021-11-05 23:58:16,555 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403229,403242] [2021-11-05 23:58:16,555 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403378,403391] [2021-11-05 23:58:16,555 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403526,403539] [2021-11-05 23:58:16,556 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403683,403696] [2021-11-05 23:58:16,556 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403832,403845] [2021-11-05 23:58:16,556 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403988,404001] [2021-11-05 23:58:16,557 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404141,404154] [2021-11-05 23:58:16,557 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404287,404300] [2021-11-05 23:58:16,557 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404430,404443] [2021-11-05 23:58:16,558 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404582,404595] [2021-11-05 23:58:16,558 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404728,404741] [2021-11-05 23:58:16,558 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404873,404886] [2021-11-05 23:58:16,559 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405027,405040] [2021-11-05 23:58:16,559 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405178,405191] [2021-11-05 23:58:16,559 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405333,405346] [2021-11-05 23:58:16,560 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405485,405498] [2021-11-05 23:58:16,560 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405640,405653] [2021-11-05 23:58:16,560 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405804,405817] [2021-11-05 23:58:16,560 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405960,405973] [2021-11-05 23:58:16,561 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406124,406137] [2021-11-05 23:58:16,561 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406266,406279] [2021-11-05 23:58:16,561 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406424,406437] [2021-11-05 23:58:16,562 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406591,406604] [2021-11-05 23:58:16,562 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406750,406763] [2021-11-05 23:58:16,562 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406909,406922] [2021-11-05 23:58:16,563 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407058,407071] [2021-11-05 23:58:16,563 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407205,407218] [2021-11-05 23:58:16,563 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407344,407357] [2021-11-05 23:58:16,564 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407507,407520] [2021-11-05 23:58:16,564 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407673,407686] [2021-11-05 23:58:16,564 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407837,407850] [2021-11-05 23:58:16,565 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408002,408015] [2021-11-05 23:58:16,565 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408167,408180] [2021-11-05 23:58:16,565 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408333,408346] [2021-11-05 23:58:16,566 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408498,408511] [2021-11-05 23:58:16,566 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408665,408678] [2021-11-05 23:58:16,566 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408825,408838] [2021-11-05 23:58:16,567 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408987,409000] [2021-11-05 23:58:16,567 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409146,409159] [2021-11-05 23:58:16,567 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409292,409305] [2021-11-05 23:58:16,568 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409435,409448] [2021-11-05 23:58:16,568 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409579,409592] [2021-11-05 23:58:16,568 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409722,409735] [2021-11-05 23:58:16,569 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409866,409879] [2021-11-05 23:58:16,569 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410007,410020] [2021-11-05 23:58:16,569 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410145,410158] [2021-11-05 23:58:16,570 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410303,410316] [2021-11-05 23:58:16,570 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410462,410475] [2021-11-05 23:58:16,570 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410618,410631] [2021-11-05 23:58:16,571 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410767,410780] [2021-11-05 23:58:16,571 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410919,410932] [2021-11-05 23:58:16,571 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411070,411083] [2021-11-05 23:58:16,572 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411219,411232] [2021-11-05 23:58:16,572 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411371,411384] [2021-11-05 23:58:16,572 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411519,411532] [2021-11-05 23:58:16,573 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411672,411685] [2021-11-05 23:58:16,573 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411823,411836] [2021-11-05 23:58:16,573 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411973,411986] [2021-11-05 23:58:16,574 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412120,412133] [2021-11-05 23:58:16,574 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412271,412284] [2021-11-05 23:58:16,574 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412422,412435] [2021-11-05 23:58:16,575 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412570,412583] [2021-11-05 23:58:16,575 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412736,412749] [2021-11-05 23:58:16,575 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412905,412918] [2021-11-05 23:58:16,576 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413072,413085] [2021-11-05 23:58:16,576 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413240,413253] [2021-11-05 23:58:16,576 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413390,413403] [2021-11-05 23:58:16,577 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413537,413550] [2021-11-05 23:58:16,577 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413698,413711] [2021-11-05 23:58:16,577 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413868,413881] [2021-11-05 23:58:16,578 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[414030,414043] [2021-11-05 23:58:16,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 23:58:16,866 INFO L208 MainTranslator]: Completed translation [2021-11-05 23:58:16,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:58:16 WrapperNode [2021-11-05 23:58:16,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-05 23:58:16,868 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-05 23:58:16,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-05 23:58:16,868 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-05 23:58:16,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:58:16" (1/1) ... [2021-11-05 23:58:16,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:58:16" (1/1) ... [2021-11-05 23:58:17,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-05 23:58:17,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-05 23:58:17,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-05 23:58:17,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-05 23:58:17,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:58:16" (1/1) ... [2021-11-05 23:58:17,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:58:16" (1/1) ... [2021-11-05 23:58:17,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:58:16" (1/1) ... [2021-11-05 23:58:17,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:58:16" (1/1) ... [2021-11-05 23:58:17,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:58:16" (1/1) ... [2021-11-05 23:58:17,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:58:16" (1/1) ... [2021-11-05 23:58:17,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:58:16" (1/1) ... [2021-11-05 23:58:17,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-05 23:58:17,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-05 23:58:17,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-05 23:58:17,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-05 23:58:17,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:58:16" (1/1) ... [2021-11-05 23:58:17,369 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 23:58:17,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 23:58:17,387 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-05 23:58:17,417 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-05 23:58:17,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-05 23:58:17,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-05 23:58:17,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-05 23:58:17,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-05 23:58:17,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-05 23:58:17,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-05 23:58:17,435 INFO L130 BoogieDeclarations]: Found specification of procedure __cmpxchg_wrong_size [2021-11-05 23:58:17,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-05 23:58:17,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-05 23:58:17,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-05 23:58:17,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-05 23:58:17,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-05 23:58:20,304 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L9761: #t~ret860 := main_#res; [2021-11-05 23:58:20,305 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-05 23:58:20,306 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_11_returnLabel: main_#res := 0; [2021-11-05 23:58:20,325 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-05 23:58:20,325 INFO L299 CfgBuilder]: Removed 1678 assume(true) statements. [2021-11-05 23:58:20,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:58:20 BoogieIcfgContainer [2021-11-05 23:58:20,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-05 23:58:20,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-05 23:58:20,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-05 23:58:20,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-05 23:58:20,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 11:58:12" (1/3) ... [2021-11-05 23:58:20,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cd9002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:58:20, skipping insertion in model container [2021-11-05 23:58:20,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:58:16" (2/3) ... [2021-11-05 23:58:20,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cd9002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:58:20, skipping insertion in model container [2021-11-05 23:58:20,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:58:20" (3/3) ... [2021-11-05 23:58:20,335 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2021-11-05 23:58:20,340 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-05 23:58:20,340 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 112 error locations. [2021-11-05 23:58:20,383 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-05 23:58:20,388 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-05 23:58:20,389 INFO L340 AbstractCegarLoop]: Starting to check reachability of 112 error locations. [2021-11-05 23:58:20,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 1427 states, 1315 states have (on average 1.388593155893536) internal successors, (1826), 1426 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:20,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-05 23:58:20,428 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:20,428 INFO L514 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-05 23:58:20,429 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:20,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:20,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1114166620, now seen corresponding path program 1 times [2021-11-05 23:58:20,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:20,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909317098] [2021-11-05 23:58:20,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:20,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:20,898 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-05 23:58:20,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:20,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909317098] [2021-11-05 23:58:20,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909317098] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:20,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:20,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:20,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757147825] [2021-11-05 23:58:20,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:20,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:20,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:20,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:20,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:20,938 INFO L87 Difference]: Start difference. First operand has 1427 states, 1315 states have (on average 1.388593155893536) internal successors, (1826), 1426 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 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-05 23:58:21,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:21,135 INFO L93 Difference]: Finished difference Result 2822 states and 3612 transitions. [2021-11-05 23:58:21,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:21,137 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-05 23:58:21,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:21,160 INFO L225 Difference]: With dead ends: 2822 [2021-11-05 23:58:21,160 INFO L226 Difference]: Without dead ends: 1328 [2021-11-05 23:58:21,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.33ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:21,173 INFO L933 BasicCegarLoop]: 1676 mSDtfsCounter, 1815 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1815 SdHoareTripleChecker+Valid, 3190 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 27.54ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.28ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:21,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1815 Valid, 3190 Invalid, 6 Unknown, 0 Unchecked, 27.54ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 8.28ms Time] [2021-11-05 23:58:21,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2021-11-05 23:58:21,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1328. [2021-11-05 23:58:21,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1218 states have (on average 1.2315270935960592) internal successors, (1500), 1327 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:21,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1500 transitions. [2021-11-05 23:58:21,304 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1500 transitions. Word has length 32 [2021-11-05 23:58:21,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:21,304 INFO L470 AbstractCegarLoop]: Abstraction has 1328 states and 1500 transitions. [2021-11-05 23:58:21,305 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-05 23:58:21,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1500 transitions. [2021-11-05 23:58:21,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-05 23:58:21,309 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:21,309 INFO L514 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-05 23:58:21,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-05 23:58:21,311 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:21,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:21,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1267414080, now seen corresponding path program 1 times [2021-11-05 23:58:21,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:21,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524694264] [2021-11-05 23:58:21,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:21,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:21,548 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-05 23:58:21,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:21,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524694264] [2021-11-05 23:58:21,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524694264] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:21,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:21,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:21,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305194021] [2021-11-05 23:58:21,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:21,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:21,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:21,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:21,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:21,552 INFO L87 Difference]: Start difference. First operand 1328 states and 1500 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-05 23:58:21,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:21,619 INFO L93 Difference]: Finished difference Result 1328 states and 1500 transitions. [2021-11-05 23:58:21,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:21,619 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-05 23:58:21,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:21,624 INFO L225 Difference]: With dead ends: 1328 [2021-11-05 23:58:21,625 INFO L226 Difference]: Without dead ends: 1324 [2021-11-05 23:58:21,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.39ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:21,626 INFO L933 BasicCegarLoop]: 1492 mSDtfsCounter, 1617 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.46ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.91ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:21,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1617 Valid, 2834 Invalid, 6 Unknown, 0 Unchecked, 8.46ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 4.91ms Time] [2021-11-05 23:58:21,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2021-11-05 23:58:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1324. [2021-11-05 23:58:21,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1216 states have (on average 1.230263157894737) internal successors, (1496), 1323 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1496 transitions. [2021-11-05 23:58:21,674 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1496 transitions. Word has length 34 [2021-11-05 23:58:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:21,675 INFO L470 AbstractCegarLoop]: Abstraction has 1324 states and 1496 transitions. [2021-11-05 23:58:21,675 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-05 23:58:21,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1496 transitions. [2021-11-05 23:58:21,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-05 23:58:21,676 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:21,676 INFO L514 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-05 23:58:21,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-05 23:58:21,677 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:21,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:21,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1801578912, now seen corresponding path program 1 times [2021-11-05 23:58:21,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:21,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908958670] [2021-11-05 23:58:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:21,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:21,860 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-05 23:58:21,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:21,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908958670] [2021-11-05 23:58:21,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908958670] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:21,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:21,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 23:58:21,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753836383] [2021-11-05 23:58:21,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:21,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 23:58:21,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:21,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 23:58:21,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:21,864 INFO L87 Difference]: Start difference. First operand 1324 states and 1496 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 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-05 23:58:22,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:22,178 INFO L93 Difference]: Finished difference Result 1938 states and 2168 transitions. [2021-11-05 23:58:22,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 23:58:22,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 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-05 23:58:22,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:22,186 INFO L225 Difference]: With dead ends: 1938 [2021-11-05 23:58:22,186 INFO L226 Difference]: Without dead ends: 1926 [2021-11-05 23:58:22,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.54ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-05 23:58:22,190 INFO L933 BasicCegarLoop]: 2117 mSDtfsCounter, 2090 mSDsluCounter, 4194 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 170.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2090 SdHoareTripleChecker+Valid, 6311 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.33ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 212.49ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:22,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2090 Valid, 6311 Invalid, 164 Unknown, 0 Unchecked, 12.33ms Time], IncrementalHoareTripleChecker [28 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 212.49ms Time] [2021-11-05 23:58:22,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2021-11-05 23:58:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1644. [2021-11-05 23:58:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1536 states have (on average 1.2115885416666667) internal successors, (1861), 1643 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 1861 transitions. [2021-11-05 23:58:22,264 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 1861 transitions. Word has length 36 [2021-11-05 23:58:22,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:22,265 INFO L470 AbstractCegarLoop]: Abstraction has 1644 states and 1861 transitions. [2021-11-05 23:58:22,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 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-05 23:58:22,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 1861 transitions. [2021-11-05 23:58:22,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-05 23:58:22,269 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:22,269 INFO L514 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-05 23:58:22,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-05 23:58:22,270 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:22,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:22,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1785631868, now seen corresponding path program 1 times [2021-11-05 23:58:22,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:22,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595665025] [2021-11-05 23:58:22,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:22,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:22,408 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-05 23:58:22,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:22,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595665025] [2021-11-05 23:58:22,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595665025] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:22,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:22,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:22,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227679169] [2021-11-05 23:58:22,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:22,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:22,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:22,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:22,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:22,412 INFO L87 Difference]: Start difference. First operand 1644 states and 1861 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-05 23:58:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:22,479 INFO L93 Difference]: Finished difference Result 1644 states and 1861 transitions. [2021-11-05 23:58:22,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:22,480 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-05 23:58:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:22,487 INFO L225 Difference]: With dead ends: 1644 [2021-11-05 23:58:22,487 INFO L226 Difference]: Without dead ends: 1640 [2021-11-05 23:58:22,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.21ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:22,490 INFO L933 BasicCegarLoop]: 1488 mSDtfsCounter, 1603 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1603 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.83ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.47ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:22,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1603 Valid, 2834 Invalid, 6 Unknown, 0 Unchecked, 4.83ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 4.47ms Time] [2021-11-05 23:58:22,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2021-11-05 23:58:22,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2021-11-05 23:58:22,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1534 states have (on average 1.2105606258148631) internal successors, (1857), 1639 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 1857 transitions. [2021-11-05 23:58:22,561 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 1857 transitions. Word has length 36 [2021-11-05 23:58:22,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:22,563 INFO L470 AbstractCegarLoop]: Abstraction has 1640 states and 1857 transitions. [2021-11-05 23:58:22,563 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-05 23:58:22,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1857 transitions. [2021-11-05 23:58:22,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-05 23:58:22,567 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:22,567 INFO L514 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-05 23:58:22,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-05 23:58:22,569 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:22,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:22,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1994842920, now seen corresponding path program 1 times [2021-11-05 23:58:22,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:22,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624741761] [2021-11-05 23:58:22,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:22,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:22,665 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-05 23:58:22,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:22,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624741761] [2021-11-05 23:58:22,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624741761] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:22,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:22,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:22,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94344309] [2021-11-05 23:58:22,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:22,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:22,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:22,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:22,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:22,668 INFO L87 Difference]: Start difference. First operand 1640 states and 1857 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-05 23:58:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:22,757 INFO L93 Difference]: Finished difference Result 1640 states and 1857 transitions. [2021-11-05 23:58:22,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:22,758 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-05 23:58:22,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:22,763 INFO L225 Difference]: With dead ends: 1640 [2021-11-05 23:58:22,763 INFO L226 Difference]: Without dead ends: 1636 [2021-11-05 23:58:22,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.47ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:22,764 INFO L933 BasicCegarLoop]: 1484 mSDtfsCounter, 1589 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 25.15ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.71ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:22,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1589 Valid, 2834 Invalid, 6 Unknown, 0 Unchecked, 25.15ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 3.71ms Time] [2021-11-05 23:58:22,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2021-11-05 23:58:22,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1636. [2021-11-05 23:58:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1532 states have (on average 1.2095300261096606) internal successors, (1853), 1635 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 1853 transitions. [2021-11-05 23:58:22,826 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 1853 transitions. Word has length 38 [2021-11-05 23:58:22,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:22,826 INFO L470 AbstractCegarLoop]: Abstraction has 1636 states and 1853 transitions. [2021-11-05 23:58:22,827 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-05 23:58:22,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 1853 transitions. [2021-11-05 23:58:22,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-05 23:58:22,828 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:22,828 INFO L514 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-05 23:58:22,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-05 23:58:22,828 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:22,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:22,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1488782124, now seen corresponding path program 1 times [2021-11-05 23:58:22,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:22,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781174465] [2021-11-05 23:58:22,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:22,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:22,912 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-05 23:58:22,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:22,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781174465] [2021-11-05 23:58:22,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781174465] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:22,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:22,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:22,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252052890] [2021-11-05 23:58:22,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:22,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:22,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:22,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:22,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:22,914 INFO L87 Difference]: Start difference. First operand 1636 states and 1853 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-05 23:58:22,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:22,983 INFO L93 Difference]: Finished difference Result 1636 states and 1853 transitions. [2021-11-05 23:58:22,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:22,984 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-05 23:58:22,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:22,990 INFO L225 Difference]: With dead ends: 1636 [2021-11-05 23:58:22,990 INFO L226 Difference]: Without dead ends: 1632 [2021-11-05 23:58:22,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.47ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:22,991 INFO L933 BasicCegarLoop]: 1480 mSDtfsCounter, 1575 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1575 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.83ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.15ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:22,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1575 Valid, 2834 Invalid, 6 Unknown, 0 Unchecked, 3.83ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 4.15ms Time] [2021-11-05 23:58:22,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2021-11-05 23:58:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1632. [2021-11-05 23:58:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1530 states have (on average 1.2084967320261437) internal successors, (1849), 1631 states have internal predecessors, (1849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 1849 transitions. [2021-11-05 23:58:23,058 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 1849 transitions. Word has length 40 [2021-11-05 23:58:23,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:23,058 INFO L470 AbstractCegarLoop]: Abstraction has 1632 states and 1849 transitions. [2021-11-05 23:58:23,058 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-05 23:58:23,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 1849 transitions. [2021-11-05 23:58:23,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-05 23:58:23,059 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:23,059 INFO L514 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-05 23:58:23,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-05 23:58:23,060 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:23,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:23,060 INFO L85 PathProgramCache]: Analyzing trace with hash 495661968, now seen corresponding path program 1 times [2021-11-05 23:58:23,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:23,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903452445] [2021-11-05 23:58:23,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:23,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:23,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:58:23,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:23,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903452445] [2021-11-05 23:58:23,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903452445] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:23,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:23,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:23,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869204418] [2021-11-05 23:58:23,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:23,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:23,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:23,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:23,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:23,148 INFO L87 Difference]: Start difference. First operand 1632 states and 1849 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-05 23:58:23,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:23,216 INFO L93 Difference]: Finished difference Result 1632 states and 1849 transitions. [2021-11-05 23:58:23,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:23,216 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-05 23:58:23,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:23,221 INFO L225 Difference]: With dead ends: 1632 [2021-11-05 23:58:23,222 INFO L226 Difference]: Without dead ends: 1628 [2021-11-05 23:58:23,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.52ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:23,223 INFO L933 BasicCegarLoop]: 1476 mSDtfsCounter, 1561 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.77ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.72ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:23,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1561 Valid, 2834 Invalid, 6 Unknown, 0 Unchecked, 3.77ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 3.72ms Time] [2021-11-05 23:58:23,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2021-11-05 23:58:23,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1628. [2021-11-05 23:58:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1528 states have (on average 1.2074607329842932) internal successors, (1845), 1627 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 1845 transitions. [2021-11-05 23:58:23,282 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 1845 transitions. Word has length 42 [2021-11-05 23:58:23,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:23,282 INFO L470 AbstractCegarLoop]: Abstraction has 1628 states and 1845 transitions. [2021-11-05 23:58:23,283 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-05 23:58:23,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1845 transitions. [2021-11-05 23:58:23,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-05 23:58:23,283 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:23,284 INFO L514 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-05 23:58:23,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-05 23:58:23,284 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:23,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:23,284 INFO L85 PathProgramCache]: Analyzing trace with hash -410067884, now seen corresponding path program 1 times [2021-11-05 23:58:23,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:23,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918152932] [2021-11-05 23:58:23,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:23,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:23,391 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-05 23:58:23,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:23,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918152932] [2021-11-05 23:58:23,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918152932] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:23,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:23,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:23,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595386510] [2021-11-05 23:58:23,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:23,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:23,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:23,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:23,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:23,393 INFO L87 Difference]: Start difference. First operand 1628 states and 1845 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-05 23:58:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:23,459 INFO L93 Difference]: Finished difference Result 1628 states and 1845 transitions. [2021-11-05 23:58:23,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:23,459 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-05 23:58:23,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:23,464 INFO L225 Difference]: With dead ends: 1628 [2021-11-05 23:58:23,464 INFO L226 Difference]: Without dead ends: 1624 [2021-11-05 23:58:23,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.31ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:23,465 INFO L933 BasicCegarLoop]: 1472 mSDtfsCounter, 1547 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.66ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.68ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:23,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1547 Valid, 2834 Invalid, 6 Unknown, 0 Unchecked, 3.66ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 3.68ms Time] [2021-11-05 23:58:23,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2021-11-05 23:58:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1624. [2021-11-05 23:58:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1526 states have (on average 1.2064220183486238) internal successors, (1841), 1623 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 1841 transitions. [2021-11-05 23:58:23,526 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 1841 transitions. Word has length 44 [2021-11-05 23:58:23,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:23,526 INFO L470 AbstractCegarLoop]: Abstraction has 1624 states and 1841 transitions. [2021-11-05 23:58:23,526 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-05 23:58:23,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1841 transitions. [2021-11-05 23:58:23,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-05 23:58:23,527 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:23,527 INFO L514 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-05 23:58:23,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-05 23:58:23,528 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:23,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash -246411345, now seen corresponding path program 1 times [2021-11-05 23:58:23,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:23,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866047135] [2021-11-05 23:58:23,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:23,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:23,615 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-05 23:58:23,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:23,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866047135] [2021-11-05 23:58:23,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866047135] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:23,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:23,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:23,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329020275] [2021-11-05 23:58:23,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:23,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:23,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:23,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:23,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:23,617 INFO L87 Difference]: Start difference. First operand 1624 states and 1841 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-05 23:58:23,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:23,784 INFO L93 Difference]: Finished difference Result 2351 states and 2661 transitions. [2021-11-05 23:58:23,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 23:58:23,784 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-05 23:58:23,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:23,792 INFO L225 Difference]: With dead ends: 2351 [2021-11-05 23:58:23,792 INFO L226 Difference]: Without dead ends: 2345 [2021-11-05 23:58:23,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.20ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:23,793 INFO L933 BasicCegarLoop]: 2278 mSDtfsCounter, 2429 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2429 SdHoareTripleChecker+Valid, 3515 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.29ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.76ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:23,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2429 Valid, 3515 Invalid, 61 Unknown, 0 Unchecked, 5.29ms Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 61.76ms Time] [2021-11-05 23:58:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2021-11-05 23:58:23,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 1618. [2021-11-05 23:58:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1523 states have (on average 1.2048588312541038) internal successors, (1835), 1617 states have internal predecessors, (1835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:23,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 1835 transitions. [2021-11-05 23:58:23,903 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 1835 transitions. Word has length 46 [2021-11-05 23:58:23,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:23,904 INFO L470 AbstractCegarLoop]: Abstraction has 1618 states and 1835 transitions. [2021-11-05 23:58:23,904 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-05 23:58:23,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 1835 transitions. [2021-11-05 23:58:23,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-05 23:58:23,905 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:23,905 INFO L514 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-05 23:58:23,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-05 23:58:23,905 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:23,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:23,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1061905784, now seen corresponding path program 1 times [2021-11-05 23:58:23,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:23,906 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645822705] [2021-11-05 23:58:23,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:23,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:24,011 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-05 23:58:24,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:24,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645822705] [2021-11-05 23:58:24,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645822705] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:24,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:24,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:24,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388485259] [2021-11-05 23:58:24,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:24,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:24,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:24,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:24,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:24,014 INFO L87 Difference]: Start difference. First operand 1618 states and 1835 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-05 23:58:24,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:24,117 INFO L93 Difference]: Finished difference Result 1618 states and 1835 transitions. [2021-11-05 23:58:24,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:24,118 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-05 23:58:24,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:24,124 INFO L225 Difference]: With dead ends: 1618 [2021-11-05 23:58:24,124 INFO L226 Difference]: Without dead ends: 1614 [2021-11-05 23:58:24,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.30ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:24,125 INFO L933 BasicCegarLoop]: 1462 mSDtfsCounter, 1527 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 2822 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.05ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.77ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:24,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1527 Valid, 2822 Invalid, 6 Unknown, 0 Unchecked, 4.05ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 4.77ms Time] [2021-11-05 23:58:24,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2021-11-05 23:58:24,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1614. [2021-11-05 23:58:24,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1521 states have (on average 1.2038132807363577) internal successors, (1831), 1613 states have internal predecessors, (1831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 1831 transitions. [2021-11-05 23:58:24,222 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 1831 transitions. Word has length 46 [2021-11-05 23:58:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:24,223 INFO L470 AbstractCegarLoop]: Abstraction has 1614 states and 1831 transitions. [2021-11-05 23:58:24,223 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-05 23:58:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 1831 transitions. [2021-11-05 23:58:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-05 23:58:24,224 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:24,224 INFO L514 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-05 23:58:24,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-05 23:58:24,224 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:24,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:24,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1710607589, now seen corresponding path program 1 times [2021-11-05 23:58:24,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:24,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960384754] [2021-11-05 23:58:24,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:24,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:24,314 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-05 23:58:24,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:24,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960384754] [2021-11-05 23:58:24,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960384754] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:24,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:24,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:24,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701327075] [2021-11-05 23:58:24,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:24,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:24,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:24,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:24,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:24,317 INFO L87 Difference]: Start difference. First operand 1614 states and 1831 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-05 23:58:24,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:24,428 INFO L93 Difference]: Finished difference Result 1614 states and 1831 transitions. [2021-11-05 23:58:24,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:24,429 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-05 23:58:24,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:24,434 INFO L225 Difference]: With dead ends: 1614 [2021-11-05 23:58:24,434 INFO L226 Difference]: Without dead ends: 1610 [2021-11-05 23:58:24,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.59ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:24,435 INFO L933 BasicCegarLoop]: 1458 mSDtfsCounter, 1513 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 2822 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.16ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.79ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:24,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1513 Valid, 2822 Invalid, 6 Unknown, 0 Unchecked, 4.16ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 4.79ms Time] [2021-11-05 23:58:24,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2021-11-05 23:58:24,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1610. [2021-11-05 23:58:24,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1519 states have (on average 1.2027649769585254) internal successors, (1827), 1609 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 1827 transitions. [2021-11-05 23:58:24,512 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 1827 transitions. Word has length 48 [2021-11-05 23:58:24,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:24,513 INFO L470 AbstractCegarLoop]: Abstraction has 1610 states and 1827 transitions. [2021-11-05 23:58:24,513 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-05 23:58:24,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1827 transitions. [2021-11-05 23:58:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-05 23:58:24,514 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:24,514 INFO L514 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-05 23:58:24,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-05 23:58:24,514 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:24,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:24,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1078733087, now seen corresponding path program 1 times [2021-11-05 23:58:24,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:24,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582249599] [2021-11-05 23:58:24,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:24,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:24,592 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-05 23:58:24,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:24,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582249599] [2021-11-05 23:58:24,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582249599] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:24,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:24,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:24,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655954061] [2021-11-05 23:58:24,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:24,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:24,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:24,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:24,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:24,595 INFO L87 Difference]: Start difference. First operand 1610 states and 1827 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-05 23:58:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:24,752 INFO L93 Difference]: Finished difference Result 2285 states and 2596 transitions. [2021-11-05 23:58:24,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 23:58:24,752 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-05 23:58:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:24,759 INFO L225 Difference]: With dead ends: 2285 [2021-11-05 23:58:24,759 INFO L226 Difference]: Without dead ends: 2281 [2021-11-05 23:58:24,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.96ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:24,761 INFO L933 BasicCegarLoop]: 1455 mSDtfsCounter, 1541 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 3590 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.09ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.76ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:24,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1541 Valid, 3590 Invalid, 13 Unknown, 0 Unchecked, 4.09ms Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 11.76ms Time] [2021-11-05 23:58:24,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2021-11-05 23:58:24,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 2145. [2021-11-05 23:58:24,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 2055 states have (on average 1.2180048661800487) internal successors, (2503), 2144 states have internal predecessors, (2503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 2503 transitions. [2021-11-05 23:58:24,875 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 2503 transitions. Word has length 50 [2021-11-05 23:58:24,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:24,875 INFO L470 AbstractCegarLoop]: Abstraction has 2145 states and 2503 transitions. [2021-11-05 23:58:24,876 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-05 23:58:24,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2503 transitions. [2021-11-05 23:58:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-05 23:58:24,877 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:24,877 INFO L514 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-05 23:58:24,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-05 23:58:24,877 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:24,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:24,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1575530371, now seen corresponding path program 1 times [2021-11-05 23:58:24,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:24,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549712140] [2021-11-05 23:58:24,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:24,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:24,991 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-05 23:58:24,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:24,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549712140] [2021-11-05 23:58:24,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549712140] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:24,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:24,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:24,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166344062] [2021-11-05 23:58:24,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:24,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:24,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:24,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:24,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:24,994 INFO L87 Difference]: Start difference. First operand 2145 states and 2503 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-05 23:58:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:25,169 INFO L93 Difference]: Finished difference Result 2806 states and 3234 transitions. [2021-11-05 23:58:25,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 23:58:25,170 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-05 23:58:25,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:25,179 INFO L225 Difference]: With dead ends: 2806 [2021-11-05 23:58:25,179 INFO L226 Difference]: Without dead ends: 2802 [2021-11-05 23:58:25,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.35ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:25,180 INFO L933 BasicCegarLoop]: 1446 mSDtfsCounter, 889 mSDsluCounter, 2483 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 3929 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.37ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.08ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:25,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [889 Valid, 3929 Invalid, 38 Unknown, 0 Unchecked, 4.37ms Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 31.08ms Time] [2021-11-05 23:58:25,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2021-11-05 23:58:25,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2711. [2021-11-05 23:58:25,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2622 states have (on average 1.2006102212051868) internal successors, (3148), 2710 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:25,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3148 transitions. [2021-11-05 23:58:25,316 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3148 transitions. Word has length 52 [2021-11-05 23:58:25,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:25,317 INFO L470 AbstractCegarLoop]: Abstraction has 2711 states and 3148 transitions. [2021-11-05 23:58:25,317 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-05 23:58:25,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3148 transitions. [2021-11-05 23:58:25,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-05 23:58:25,318 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:25,318 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:58:25,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-05 23:58:25,318 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:25,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:25,319 INFO L85 PathProgramCache]: Analyzing trace with hash 54559857, now seen corresponding path program 1 times [2021-11-05 23:58:25,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:25,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906575660] [2021-11-05 23:58:25,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:25,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:25,394 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-05 23:58:25,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:25,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906575660] [2021-11-05 23:58:25,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906575660] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:25,395 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:25,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:25,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563304920] [2021-11-05 23:58:25,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:25,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 23:58:25,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:25,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 23:58:25,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 23:58:25,397 INFO L87 Difference]: Start difference. First operand 2711 states and 3148 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:25,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:25,569 INFO L93 Difference]: Finished difference Result 5015 states and 5842 transitions. [2021-11-05 23:58:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 23:58:25,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-05 23:58:25,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:25,579 INFO L225 Difference]: With dead ends: 5015 [2021-11-05 23:58:25,579 INFO L226 Difference]: Without dead ends: 2839 [2021-11-05 23:58:25,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.81ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 23:58:25,583 INFO L933 BasicCegarLoop]: 1455 mSDtfsCounter, 149 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 2907 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.58ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.91ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:25,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 2907 Invalid, 8 Unknown, 0 Unchecked, 2.58ms Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 8.91ms Time] [2021-11-05 23:58:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2021-11-05 23:58:25,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2712. [2021-11-05 23:58:25,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2712 states, 2623 states have (on average 1.2005337399923752) internal successors, (3149), 2711 states have internal predecessors, (3149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:25,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2712 states and 3149 transitions. [2021-11-05 23:58:25,715 INFO L78 Accepts]: Start accepts. Automaton has 2712 states and 3149 transitions. Word has length 53 [2021-11-05 23:58:25,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:25,716 INFO L470 AbstractCegarLoop]: Abstraction has 2712 states and 3149 transitions. [2021-11-05 23:58:25,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:25,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 3149 transitions. [2021-11-05 23:58:25,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-05 23:58:25,717 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:25,717 INFO L514 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-05 23:58:25,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-05 23:58:25,717 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:25,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:25,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2038616505, now seen corresponding path program 1 times [2021-11-05 23:58:25,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:25,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642155524] [2021-11-05 23:58:25,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:25,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:25,800 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-05 23:58:25,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:25,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642155524] [2021-11-05 23:58:25,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642155524] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:25,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:25,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:25,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718912257] [2021-11-05 23:58:25,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:25,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:25,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:25,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:25,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:25,803 INFO L87 Difference]: Start difference. First operand 2712 states and 3149 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-05 23:58:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:25,946 INFO L93 Difference]: Finished difference Result 2712 states and 3149 transitions. [2021-11-05 23:58:25,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:25,947 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-05 23:58:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:25,964 INFO L225 Difference]: With dead ends: 2712 [2021-11-05 23:58:25,964 INFO L226 Difference]: Without dead ends: 2708 [2021-11-05 23:58:25,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.16ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:25,968 INFO L933 BasicCegarLoop]: 1441 mSDtfsCounter, 1475 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 2812 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.30ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.28ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:25,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1475 Valid, 2812 Invalid, 24 Unknown, 0 Unchecked, 3.30ms Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 16.28ms Time] [2021-11-05 23:58:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2021-11-05 23:58:26,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2708. [2021-11-05 23:58:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2708 states, 2621 states have (on average 1.1999236932468524) internal successors, (3145), 2707 states have internal predecessors, (3145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 3145 transitions. [2021-11-05 23:58:26,151 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 3145 transitions. Word has length 54 [2021-11-05 23:58:26,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:26,151 INFO L470 AbstractCegarLoop]: Abstraction has 2708 states and 3145 transitions. [2021-11-05 23:58:26,152 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-05 23:58:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3145 transitions. [2021-11-05 23:58:26,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-05 23:58:26,153 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:26,153 INFO L514 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-05 23:58:26,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-05 23:58:26,153 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:26,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:26,154 INFO L85 PathProgramCache]: Analyzing trace with hash 377020572, now seen corresponding path program 1 times [2021-11-05 23:58:26,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:26,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858968788] [2021-11-05 23:58:26,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:26,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:58:26,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:26,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858968788] [2021-11-05 23:58:26,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858968788] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:26,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:26,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 23:58:26,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926933939] [2021-11-05 23:58:26,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:26,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:26,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:26,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:26,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:26,400 INFO L87 Difference]: Start difference. First operand 2708 states and 3145 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-05 23:58:26,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:26,788 INFO L93 Difference]: Finished difference Result 6618 states and 7728 transitions. [2021-11-05 23:58:26,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:26,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-05 23:58:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:26,801 INFO L225 Difference]: With dead ends: 6618 [2021-11-05 23:58:26,801 INFO L226 Difference]: Without dead ends: 4259 [2021-11-05 23:58:26,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.35ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:26,807 INFO L933 BasicCegarLoop]: 1521 mSDtfsCounter, 1033 mSDsluCounter, 2802 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 128.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 4323 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.93ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 168.26ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:26,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1033 Valid, 4323 Invalid, 176 Unknown, 0 Unchecked, 4.93ms Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 168.26ms Time] [2021-11-05 23:58:26,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2021-11-05 23:58:26,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 2594. [2021-11-05 23:58:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2594 states, 2507 states have (on average 1.20063821300359) internal successors, (3010), 2593 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 3010 transitions. [2021-11-05 23:58:26,965 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 3010 transitions. Word has length 54 [2021-11-05 23:58:26,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:26,966 INFO L470 AbstractCegarLoop]: Abstraction has 2594 states and 3010 transitions. [2021-11-05 23:58:26,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-05 23:58:26,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3010 transitions. [2021-11-05 23:58:26,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-05 23:58:26,967 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:26,967 INFO L514 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-05 23:58:26,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-05 23:58:26,967 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:26,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:26,968 INFO L85 PathProgramCache]: Analyzing trace with hash -605221525, now seen corresponding path program 1 times [2021-11-05 23:58:26,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:26,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249902492] [2021-11-05 23:58:26,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:26,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:27,091 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-05 23:58:27,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:27,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249902492] [2021-11-05 23:58:27,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249902492] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:27,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:27,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:27,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626667760] [2021-11-05 23:58:27,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:27,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:27,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:27,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:27,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:27,094 INFO L87 Difference]: Start difference. First operand 2594 states and 3010 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-05 23:58:27,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:27,343 INFO L93 Difference]: Finished difference Result 2955 states and 3406 transitions. [2021-11-05 23:58:27,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 23:58:27,344 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-05 23:58:27,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:27,350 INFO L225 Difference]: With dead ends: 2955 [2021-11-05 23:58:27,351 INFO L226 Difference]: Without dead ends: 2951 [2021-11-05 23:58:27,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.75ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:27,352 INFO L933 BasicCegarLoop]: 1443 mSDtfsCounter, 615 mSDsluCounter, 2781 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 4224 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.84ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.17ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:27,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [615 Valid, 4224 Invalid, 58 Unknown, 0 Unchecked, 4.84ms Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 53.17ms Time] [2021-11-05 23:58:27,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2021-11-05 23:58:27,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2871. [2021-11-05 23:58:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2784 states have (on average 1.1968390804597702) internal successors, (3332), 2870 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 3332 transitions. [2021-11-05 23:58:27,545 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 3332 transitions. Word has length 56 [2021-11-05 23:58:27,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:27,545 INFO L470 AbstractCegarLoop]: Abstraction has 2871 states and 3332 transitions. [2021-11-05 23:58:27,546 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-05 23:58:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 3332 transitions. [2021-11-05 23:58:27,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-05 23:58:27,546 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:27,547 INFO L514 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-05 23:58:27,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-05 23:58:27,547 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:27,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:27,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1940687920, now seen corresponding path program 1 times [2021-11-05 23:58:27,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:27,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878708050] [2021-11-05 23:58:27,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:27,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:27,625 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-05 23:58:27,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:27,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878708050] [2021-11-05 23:58:27,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878708050] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 23:58:27,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108111660] [2021-11-05 23:58:27,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:27,626 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 23:58:27,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 23:58:27,631 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-05 23:58:27,663 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-05 23:58:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:28,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-05 23:58:28,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 23:58:28,295 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-05 23:58:28,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 23:58:28,398 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-05 23:58:28,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108111660] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 23:58:28,398 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-05 23:58:28,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-05 23:58:28,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576472560] [2021-11-05 23:58:28,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-05 23:58:28,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 23:58:28,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:28,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 23:58:28,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-05 23:58:28,400 INFO L87 Difference]: Start difference. First operand 2871 states and 3332 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:28,653 INFO L93 Difference]: Finished difference Result 5365 states and 6250 transitions. [2021-11-05 23:58:28,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 23:58:28,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-05 23:58:28,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:28,661 INFO L225 Difference]: With dead ends: 5365 [2021-11-05 23:58:28,661 INFO L226 Difference]: Without dead ends: 3255 [2021-11-05 23:58:28,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 14.64ms TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-05 23:58:28,665 INFO L933 BasicCegarLoop]: 1451 mSDtfsCounter, 1329 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 3193 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.02ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.54ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:28,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1329 Valid, 3193 Invalid, 20 Unknown, 0 Unchecked, 4.02ms Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 25.54ms Time] [2021-11-05 23:58:28,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2021-11-05 23:58:28,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 3171. [2021-11-05 23:58:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3171 states, 3084 states have (on average 1.212710765239948) internal successors, (3740), 3170 states have internal predecessors, (3740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 3740 transitions. [2021-11-05 23:58:28,869 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 3740 transitions. Word has length 58 [2021-11-05 23:58:28,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:28,869 INFO L470 AbstractCegarLoop]: Abstraction has 3171 states and 3740 transitions. [2021-11-05 23:58:28,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:28,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 3740 transitions. [2021-11-05 23:58:28,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-05 23:58:28,871 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:28,871 INFO L514 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-05 23:58:28,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-05 23:58:29,091 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,SelfDestructingSolverStorable17 [2021-11-05 23:58:29,092 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:29,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:29,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1797147409, now seen corresponding path program 1 times [2021-11-05 23:58:29,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:29,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988845102] [2021-11-05 23:58:29,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:29,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:29,183 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-05 23:58:29,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:29,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988845102] [2021-11-05 23:58:29,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988845102] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:29,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:29,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:29,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127226213] [2021-11-05 23:58:29,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:29,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:29,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:29,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:29,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:29,186 INFO L87 Difference]: Start difference. First operand 3171 states and 3740 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-05 23:58:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:29,358 INFO L93 Difference]: Finished difference Result 3171 states and 3740 transitions. [2021-11-05 23:58:29,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:29,358 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-05 23:58:29,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:29,364 INFO L225 Difference]: With dead ends: 3171 [2021-11-05 23:58:29,364 INFO L226 Difference]: Without dead ends: 3167 [2021-11-05 23:58:29,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.06ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:29,365 INFO L933 BasicCegarLoop]: 1437 mSDtfsCounter, 1451 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1451 SdHoareTripleChecker+Valid, 2820 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.24ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.06ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:29,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1451 Valid, 2820 Invalid, 24 Unknown, 0 Unchecked, 3.24ms Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 16.06ms Time] [2021-11-05 23:58:29,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3167 states. [2021-11-05 23:58:29,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3167 to 3167. [2021-11-05 23:58:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3167 states, 3082 states have (on average 1.2121998702141468) internal successors, (3736), 3166 states have internal predecessors, (3736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 3736 transitions. [2021-11-05 23:58:29,533 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 3736 transitions. Word has length 58 [2021-11-05 23:58:29,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:29,533 INFO L470 AbstractCegarLoop]: Abstraction has 3167 states and 3736 transitions. [2021-11-05 23:58:29,534 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-05 23:58:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 3736 transitions. [2021-11-05 23:58:29,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-05 23:58:29,535 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:29,535 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:58:29,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-05 23:58:29,535 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:29,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:29,536 INFO L85 PathProgramCache]: Analyzing trace with hash 17777306, now seen corresponding path program 1 times [2021-11-05 23:58:29,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:29,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092727003] [2021-11-05 23:58:29,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:29,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:29,639 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-05 23:58:29,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:29,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092727003] [2021-11-05 23:58:29,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092727003] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:29,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:29,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:29,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127142728] [2021-11-05 23:58:29,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:29,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:29,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:29,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:29,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:29,642 INFO L87 Difference]: Start difference. First operand 3167 states and 3736 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:29,991 INFO L93 Difference]: Finished difference Result 5066 states and 5903 transitions. [2021-11-05 23:58:29,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 23:58:29,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-05 23:58:29,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:30,001 INFO L225 Difference]: With dead ends: 5066 [2021-11-05 23:58:30,001 INFO L226 Difference]: Without dead ends: 5058 [2021-11-05 23:58:30,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.32ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:30,003 INFO L933 BasicCegarLoop]: 2670 mSDtfsCounter, 2301 mSDsluCounter, 3141 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2301 SdHoareTripleChecker+Valid, 5811 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.15ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.58ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:30,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2301 Valid, 5811 Invalid, 78 Unknown, 0 Unchecked, 6.15ms Time], IncrementalHoareTripleChecker [15 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 62.58ms Time] [2021-11-05 23:58:30,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5058 states. [2021-11-05 23:58:30,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5058 to 3161. [2021-11-05 23:58:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3161 states, 3079 states have (on average 1.2078596947060734) internal successors, (3719), 3160 states have internal predecessors, (3719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 3719 transitions. [2021-11-05 23:58:30,180 INFO L78 Accepts]: Start accepts. Automaton has 3161 states and 3719 transitions. Word has length 59 [2021-11-05 23:58:30,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:30,180 INFO L470 AbstractCegarLoop]: Abstraction has 3161 states and 3719 transitions. [2021-11-05 23:58:30,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:30,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 3719 transitions. [2021-11-05 23:58:30,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-05 23:58:30,181 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:30,181 INFO L514 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-05 23:58:30,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-05 23:58:30,182 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:30,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:30,182 INFO L85 PathProgramCache]: Analyzing trace with hash -481653549, now seen corresponding path program 1 times [2021-11-05 23:58:30,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:30,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098742075] [2021-11-05 23:58:30,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:30,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:30,279 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-05 23:58:30,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:30,280 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098742075] [2021-11-05 23:58:30,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098742075] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:30,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:30,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:30,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424215842] [2021-11-05 23:58:30,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:30,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:30,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:30,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:30,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:30,283 INFO L87 Difference]: Start difference. First operand 3161 states and 3719 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-05 23:58:30,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:30,485 INFO L93 Difference]: Finished difference Result 3161 states and 3719 transitions. [2021-11-05 23:58:30,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:30,486 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-05 23:58:30,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:30,492 INFO L225 Difference]: With dead ends: 3161 [2021-11-05 23:58:30,492 INFO L226 Difference]: Without dead ends: 3157 [2021-11-05 23:58:30,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.02ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:30,519 INFO L933 BasicCegarLoop]: 1436 mSDtfsCounter, 1431 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1431 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.25ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.48ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:30,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1431 Valid, 2826 Invalid, 6 Unknown, 0 Unchecked, 3.25ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 4.48ms Time] [2021-11-05 23:58:30,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3157 states. [2021-11-05 23:58:30,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3157 to 3157. [2021-11-05 23:58:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3157 states, 3077 states have (on average 1.2073448163795906) internal successors, (3715), 3156 states have internal predecessors, (3715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 3157 states and 3715 transitions. [2021-11-05 23:58:30,701 INFO L78 Accepts]: Start accepts. Automaton has 3157 states and 3715 transitions. Word has length 60 [2021-11-05 23:58:30,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:30,701 INFO L470 AbstractCegarLoop]: Abstraction has 3157 states and 3715 transitions. [2021-11-05 23:58:30,702 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-05 23:58:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3157 states and 3715 transitions. [2021-11-05 23:58:30,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-05 23:58:30,703 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:30,703 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:58:30,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-05 23:58:30,703 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:30,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:30,704 INFO L85 PathProgramCache]: Analyzing trace with hash -95745666, now seen corresponding path program 1 times [2021-11-05 23:58:30,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:30,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778814022] [2021-11-05 23:58:30,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:30,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:30,798 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-05 23:58:30,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:30,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778814022] [2021-11-05 23:58:30,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778814022] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:30,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:30,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:30,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792788690] [2021-11-05 23:58:30,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:30,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:30,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:30,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:30,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:30,801 INFO L87 Difference]: Start difference. First operand 3157 states and 3715 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:31,128 INFO L93 Difference]: Finished difference Result 4962 states and 5806 transitions. [2021-11-05 23:58:31,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:31,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-05 23:58:31,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:31,139 INFO L225 Difference]: With dead ends: 4962 [2021-11-05 23:58:31,139 INFO L226 Difference]: Without dead ends: 4944 [2021-11-05 23:58:31,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.04ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:31,142 INFO L933 BasicCegarLoop]: 2505 mSDtfsCounter, 2753 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2753 SdHoareTripleChecker+Valid, 3628 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.32ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.09ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:31,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2753 Valid, 3628 Invalid, 49 Unknown, 0 Unchecked, 5.32ms Time], IncrementalHoareTripleChecker [20 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 31.09ms Time] [2021-11-05 23:58:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2021-11-05 23:58:31,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 3139. [2021-11-05 23:58:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3139 states, 3068 states have (on average 1.1991525423728813) internal successors, (3679), 3138 states have internal predecessors, (3679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 3679 transitions. [2021-11-05 23:58:31,439 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 3679 transitions. Word has length 61 [2021-11-05 23:58:31,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:31,441 INFO L470 AbstractCegarLoop]: Abstraction has 3139 states and 3679 transitions. [2021-11-05 23:58:31,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 3679 transitions. [2021-11-05 23:58:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-05 23:58:31,442 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:31,443 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:58:31,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-05 23:58:31,443 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:31,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:31,444 INFO L85 PathProgramCache]: Analyzing trace with hash 987561239, now seen corresponding path program 1 times [2021-11-05 23:58:31,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:31,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625912988] [2021-11-05 23:58:31,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:31,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:31,567 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-05 23:58:31,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:31,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625912988] [2021-11-05 23:58:31,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625912988] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:31,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:31,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:31,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360283846] [2021-11-05 23:58:31,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:31,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:31,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:31,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:31,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:31,570 INFO L87 Difference]: Start difference. First operand 3139 states and 3679 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:31,807 INFO L93 Difference]: Finished difference Result 3139 states and 3679 transitions. [2021-11-05 23:58:31,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:31,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-05 23:58:31,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:31,818 INFO L225 Difference]: With dead ends: 3139 [2021-11-05 23:58:31,819 INFO L226 Difference]: Without dead ends: 3135 [2021-11-05 23:58:31,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.08ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:31,821 INFO L933 BasicCegarLoop]: 1414 mSDtfsCounter, 1399 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 2790 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.33ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.27ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:31,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1399 Valid, 2790 Invalid, 6 Unknown, 0 Unchecked, 3.33ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 5.27ms Time] [2021-11-05 23:58:31,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2021-11-05 23:58:32,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 3135. [2021-11-05 23:58:32,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3135 states, 3066 states have (on average 1.1986301369863013) internal successors, (3675), 3134 states have internal predecessors, (3675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 3675 transitions. [2021-11-05 23:58:32,043 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 3675 transitions. Word has length 62 [2021-11-05 23:58:32,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:32,043 INFO L470 AbstractCegarLoop]: Abstraction has 3135 states and 3675 transitions. [2021-11-05 23:58:32,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:32,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 3675 transitions. [2021-11-05 23:58:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-05 23:58:32,045 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:32,045 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:58:32,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-05 23:58:32,045 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:32,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:32,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1817139006, now seen corresponding path program 1 times [2021-11-05 23:58:32,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:32,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985816444] [2021-11-05 23:58:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:32,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:32,273 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-05 23:58:32,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:32,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985816444] [2021-11-05 23:58:32,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985816444] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:32,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:32,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-05 23:58:32,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003140401] [2021-11-05 23:58:32,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:32,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-05 23:58:32,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:32,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-05 23:58:32,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-05 23:58:32,276 INFO L87 Difference]: Start difference. First operand 3135 states and 3675 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:33,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:33,516 INFO L93 Difference]: Finished difference Result 5244 states and 6104 transitions. [2021-11-05 23:58:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-05 23:58:33,524 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-05 23:58:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:33,528 INFO L225 Difference]: With dead ends: 5244 [2021-11-05 23:58:33,529 INFO L226 Difference]: Without dead ends: 2782 [2021-11-05 23:58:33,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 111.08ms TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-11-05 23:58:33,534 INFO L933 BasicCegarLoop]: 1290 mSDtfsCounter, 1982 mSDsluCounter, 2888 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 826.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1982 SdHoareTripleChecker+Valid, 4178 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.47ms SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 937.05ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:33,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1982 Valid, 4178 Invalid, 439 Unknown, 0 Unchecked, 6.47ms Time], IncrementalHoareTripleChecker [98 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 937.05ms Time] [2021-11-05 23:58:33,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2021-11-05 23:58:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 2446. [2021-11-05 23:58:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2446 states, 2388 states have (on average 1.1867671691792294) internal successors, (2834), 2445 states have internal predecessors, (2834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:33,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 2834 transitions. [2021-11-05 23:58:33,704 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 2834 transitions. Word has length 63 [2021-11-05 23:58:33,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:33,705 INFO L470 AbstractCegarLoop]: Abstraction has 2446 states and 2834 transitions. [2021-11-05 23:58:33,705 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:33,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 2834 transitions. [2021-11-05 23:58:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-05 23:58:33,706 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:33,706 INFO L514 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] [2021-11-05 23:58:33,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-05 23:58:33,707 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:33,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:33,707 INFO L85 PathProgramCache]: Analyzing trace with hash -141267525, now seen corresponding path program 1 times [2021-11-05 23:58:33,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:33,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003839155] [2021-11-05 23:58:33,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:33,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:33,798 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-05 23:58:33,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:33,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003839155] [2021-11-05 23:58:33,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003839155] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:33,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:33,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:33,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623961139] [2021-11-05 23:58:33,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:33,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:33,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:33,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:33,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:33,801 INFO L87 Difference]: Start difference. First operand 2446 states and 2834 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:33,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:33,973 INFO L93 Difference]: Finished difference Result 2446 states and 2834 transitions. [2021-11-05 23:58:33,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:33,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-05 23:58:33,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:33,978 INFO L225 Difference]: With dead ends: 2446 [2021-11-05 23:58:33,978 INFO L226 Difference]: Without dead ends: 2442 [2021-11-05 23:58:33,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.44ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:33,979 INFO L933 BasicCegarLoop]: 1219 mSDtfsCounter, 1194 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.68ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.31ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:33,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1194 Valid, 2408 Invalid, 6 Unknown, 0 Unchecked, 2.68ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 4.31ms Time] [2021-11-05 23:58:33,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2021-11-05 23:58:34,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2442. [2021-11-05 23:58:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 2386 states have (on average 1.1860854987426654) internal successors, (2830), 2441 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 2830 transitions. [2021-11-05 23:58:34,148 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 2830 transitions. Word has length 64 [2021-11-05 23:58:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:34,148 INFO L470 AbstractCegarLoop]: Abstraction has 2442 states and 2830 transitions. [2021-11-05 23:58:34,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:34,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 2830 transitions. [2021-11-05 23:58:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-05 23:58:34,149 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:34,149 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:58:34,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-05 23:58:34,149 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:34,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:34,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1681016511, now seen corresponding path program 1 times [2021-11-05 23:58:34,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:34,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61927687] [2021-11-05 23:58:34,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:34,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:34,241 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-05 23:58:34,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:34,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61927687] [2021-11-05 23:58:34,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61927687] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:34,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:34,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:34,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838847147] [2021-11-05 23:58:34,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:34,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:34,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:34,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:34,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:34,244 INFO L87 Difference]: Start difference. First operand 2442 states and 2830 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:34,437 INFO L93 Difference]: Finished difference Result 2442 states and 2830 transitions. [2021-11-05 23:58:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:34,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-11-05 23:58:34,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:34,441 INFO L225 Difference]: With dead ends: 2442 [2021-11-05 23:58:34,441 INFO L226 Difference]: Without dead ends: 2438 [2021-11-05 23:58:34,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.06ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:34,442 INFO L933 BasicCegarLoop]: 1215 mSDtfsCounter, 1180 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.40ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.70ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:34,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1180 Valid, 2408 Invalid, 6 Unknown, 0 Unchecked, 2.40ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 4.70ms Time] [2021-11-05 23:58:34,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2438 states. [2021-11-05 23:58:34,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2438 to 2438. [2021-11-05 23:58:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2438 states, 2384 states have (on average 1.1854026845637584) internal successors, (2826), 2437 states have internal predecessors, (2826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 2826 transitions. [2021-11-05 23:58:34,619 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 2826 transitions. Word has length 66 [2021-11-05 23:58:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:34,620 INFO L470 AbstractCegarLoop]: Abstraction has 2438 states and 2826 transitions. [2021-11-05 23:58:34,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:34,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 2826 transitions. [2021-11-05 23:58:34,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-05 23:58:34,622 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:34,622 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:58:34,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-05 23:58:34,623 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:34,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:34,623 INFO L85 PathProgramCache]: Analyzing trace with hash 549318691, now seen corresponding path program 1 times [2021-11-05 23:58:34,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:34,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826339340] [2021-11-05 23:58:34,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:34,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:34,713 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-05 23:58:34,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:34,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826339340] [2021-11-05 23:58:34,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826339340] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:34,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:34,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:34,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933187308] [2021-11-05 23:58:34,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:34,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:34,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:34,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:34,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:34,716 INFO L87 Difference]: Start difference. First operand 2438 states and 2826 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:34,897 INFO L93 Difference]: Finished difference Result 2438 states and 2826 transitions. [2021-11-05 23:58:34,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:34,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-11-05 23:58:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:34,902 INFO L225 Difference]: With dead ends: 2438 [2021-11-05 23:58:34,902 INFO L226 Difference]: Without dead ends: 2434 [2021-11-05 23:58:34,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.68ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:34,904 INFO L933 BasicCegarLoop]: 1211 mSDtfsCounter, 1166 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.71ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.05ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:34,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1166 Valid, 2408 Invalid, 6 Unknown, 0 Unchecked, 2.71ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 4.05ms Time] [2021-11-05 23:58:34,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2021-11-05 23:58:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2021-11-05 23:58:35,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2382 states have (on average 1.1847187237615449) internal successors, (2822), 2433 states have internal predecessors, (2822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 2822 transitions. [2021-11-05 23:58:35,093 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 2822 transitions. Word has length 68 [2021-11-05 23:58:35,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:35,093 INFO L470 AbstractCegarLoop]: Abstraction has 2434 states and 2822 transitions. [2021-11-05 23:58:35,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 2822 transitions. [2021-11-05 23:58:35,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-05 23:58:35,094 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:35,094 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:58:35,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-05 23:58:35,095 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:35,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:35,096 INFO L85 PathProgramCache]: Analyzing trace with hash -385560089, now seen corresponding path program 1 times [2021-11-05 23:58:35,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:35,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917818651] [2021-11-05 23:58:35,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:35,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:35,228 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-05 23:58:35,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:35,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917818651] [2021-11-05 23:58:35,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917818651] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:35,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:35,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:35,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025994239] [2021-11-05 23:58:35,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:35,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:35,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:35,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:35,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:35,231 INFO L87 Difference]: Start difference. First operand 2434 states and 2822 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:35,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:35,415 INFO L93 Difference]: Finished difference Result 2434 states and 2822 transitions. [2021-11-05 23:58:35,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:35,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2021-11-05 23:58:35,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:35,419 INFO L225 Difference]: With dead ends: 2434 [2021-11-05 23:58:35,420 INFO L226 Difference]: Without dead ends: 2430 [2021-11-05 23:58:35,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.52ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:35,421 INFO L933 BasicCegarLoop]: 1207 mSDtfsCounter, 1152 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.60ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.97ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:35,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1152 Valid, 2408 Invalid, 6 Unknown, 0 Unchecked, 2.60ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 3.97ms Time] [2021-11-05 23:58:35,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2021-11-05 23:58:35,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2430. [2021-11-05 23:58:35,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2430 states, 2380 states have (on average 1.1840336134453782) internal successors, (2818), 2429 states have internal predecessors, (2818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:35,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 2818 transitions. [2021-11-05 23:58:35,609 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 2818 transitions. Word has length 70 [2021-11-05 23:58:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:35,609 INFO L470 AbstractCegarLoop]: Abstraction has 2430 states and 2818 transitions. [2021-11-05 23:58:35,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:35,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 2818 transitions. [2021-11-05 23:58:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-05 23:58:35,610 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:35,610 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:58:35,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-05 23:58:35,611 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:35,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:35,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1155902453, now seen corresponding path program 1 times [2021-11-05 23:58:35,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:35,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331070847] [2021-11-05 23:58:35,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:35,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:35,708 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-05 23:58:35,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:35,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331070847] [2021-11-05 23:58:35,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331070847] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:35,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:35,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:35,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463203763] [2021-11-05 23:58:35,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:35,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:35,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:35,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:35,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:35,711 INFO L87 Difference]: Start difference. First operand 2430 states and 2818 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:35,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:35,901 INFO L93 Difference]: Finished difference Result 2430 states and 2818 transitions. [2021-11-05 23:58:35,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:35,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-05 23:58:35,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:35,906 INFO L225 Difference]: With dead ends: 2430 [2021-11-05 23:58:35,906 INFO L226 Difference]: Without dead ends: 2331 [2021-11-05 23:58:35,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.47ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:35,908 INFO L933 BasicCegarLoop]: 1205 mSDtfsCounter, 1138 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.74ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.80ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:35,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1138 Valid, 2410 Invalid, 4 Unknown, 0 Unchecked, 2.74ms Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 2.80ms Time] [2021-11-05 23:58:35,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2021-11-05 23:58:36,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 2331. [2021-11-05 23:58:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2331 states, 2283 states have (on average 1.1883486640385457) internal successors, (2713), 2330 states have internal predecessors, (2713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2331 states to 2331 states and 2713 transitions. [2021-11-05 23:58:36,155 INFO L78 Accepts]: Start accepts. Automaton has 2331 states and 2713 transitions. Word has length 72 [2021-11-05 23:58:36,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:36,155 INFO L470 AbstractCegarLoop]: Abstraction has 2331 states and 2713 transitions. [2021-11-05 23:58:36,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:36,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 2713 transitions. [2021-11-05 23:58:36,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-05 23:58:36,157 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:36,157 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:58:36,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-05 23:58:36,157 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:36,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:36,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1562532637, now seen corresponding path program 1 times [2021-11-05 23:58:36,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:36,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5630267] [2021-11-05 23:58:36,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:36,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:36,273 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-05 23:58:36,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:36,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5630267] [2021-11-05 23:58:36,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5630267] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 23:58:36,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661463801] [2021-11-05 23:58:36,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:36,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 23:58:36,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 23:58:36,276 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-05 23:58:36,283 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-05 23:58:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:36,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-05 23:58:36,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 23:58:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:58:36,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 23:58:36,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661463801] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:36,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-05 23:58:36,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-11-05 23:58:36,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604070008] [2021-11-05 23:58:36,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:36,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 23:58:36,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:37,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 23:58:37,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-05 23:58:37,000 INFO L87 Difference]: Start difference. First operand 2331 states and 2713 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:37,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:37,649 INFO L93 Difference]: Finished difference Result 4154 states and 4763 transitions. [2021-11-05 23:58:37,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 23:58:37,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2021-11-05 23:58:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:37,657 INFO L225 Difference]: With dead ends: 4154 [2021-11-05 23:58:37,657 INFO L226 Difference]: Without dead ends: 4150 [2021-11-05 23:58:37,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 43.56ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-05 23:58:37,659 INFO L933 BasicCegarLoop]: 2323 mSDtfsCounter, 2866 mSDsluCounter, 2030 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 271.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2866 SdHoareTripleChecker+Valid, 4353 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.67ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 299.68ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:37,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2866 Valid, 4353 Invalid, 57 Unknown, 0 Unchecked, 5.67ms Time], IncrementalHoareTripleChecker [13 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 299.68ms Time] [2021-11-05 23:58:37,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4150 states. [2021-11-05 23:58:37,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4150 to 2327. [2021-11-05 23:58:37,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2327 states, 2281 states have (on average 1.1863217886891715) internal successors, (2706), 2326 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 2706 transitions. [2021-11-05 23:58:37,875 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 2706 transitions. Word has length 78 [2021-11-05 23:58:37,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:37,876 INFO L470 AbstractCegarLoop]: Abstraction has 2327 states and 2706 transitions. [2021-11-05 23:58:37,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 2706 transitions. [2021-11-05 23:58:37,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-05 23:58:37,877 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:37,878 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:58:37,912 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-05 23:58:38,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 23:58:38,092 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:38,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:38,092 INFO L85 PathProgramCache]: Analyzing trace with hash 62104588, now seen corresponding path program 1 times [2021-11-05 23:58:38,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:38,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069695849] [2021-11-05 23:58:38,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:38,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-05 23:58:38,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:38,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069695849] [2021-11-05 23:58:38,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069695849] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 23:58:38,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553347251] [2021-11-05 23:58:38,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:38,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 23:58:38,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 23:58:38,240 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-05 23:58:38,241 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-05 23:58:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:38,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 1489 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-05 23:58:38,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 23:58:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-05 23:58:38,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 23:58:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-05 23:58:39,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553347251] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 23:58:39,171 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-05 23:58:39,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2021-11-05 23:58:39,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054333141] [2021-11-05 23:58:39,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-05 23:58:39,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 23:58:39,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:39,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 23:58:39,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-05 23:58:39,172 INFO L87 Difference]: Start difference. First operand 2327 states and 2706 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:39,766 INFO L93 Difference]: Finished difference Result 2339 states and 2712 transitions. [2021-11-05 23:58:39,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 23:58:39,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 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 97 [2021-11-05 23:58:39,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:39,769 INFO L225 Difference]: With dead ends: 2339 [2021-11-05 23:58:39,769 INFO L226 Difference]: Without dead ends: 2327 [2021-11-05 23:58:39,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 191 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 28.13ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-05 23:58:39,770 INFO L933 BasicCegarLoop]: 1531 mSDtfsCounter, 2891 mSDsluCounter, 3484 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 354.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2891 SdHoareTripleChecker+Valid, 5015 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.15ms SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 395.06ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:39,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2891 Valid, 5015 Invalid, 159 Unknown, 0 Unchecked, 5.15ms Time], IncrementalHoareTripleChecker [49 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 395.06ms Time] [2021-11-05 23:58:39,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2021-11-05 23:58:39,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 2250. [2021-11-05 23:58:39,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2250 states, 2210 states have (on average 1.1841628959276018) internal successors, (2617), 2249 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:39,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 2617 transitions. [2021-11-05 23:58:39,932 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 2617 transitions. Word has length 97 [2021-11-05 23:58:39,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:39,933 INFO L470 AbstractCegarLoop]: Abstraction has 2250 states and 2617 transitions. [2021-11-05 23:58:39,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:39,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 2617 transitions. [2021-11-05 23:58:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-05 23:58:39,935 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:39,935 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:58:39,964 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-05 23:58:40,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 23:58:40,161 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:40,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:40,162 INFO L85 PathProgramCache]: Analyzing trace with hash -276917568, now seen corresponding path program 1 times [2021-11-05 23:58:40,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:40,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254115977] [2021-11-05 23:58:40,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:40,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:58:40,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:40,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254115977] [2021-11-05 23:58:40,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254115977] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:40,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:40,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:40,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114977946] [2021-11-05 23:58:40,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:40,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:40,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:40,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:40,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:40,327 INFO L87 Difference]: Start difference. First operand 2250 states and 2617 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:40,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:40,620 INFO L93 Difference]: Finished difference Result 2500 states and 2907 transitions. [2021-11-05 23:58:40,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 23:58:40,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-11-05 23:58:40,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:40,624 INFO L225 Difference]: With dead ends: 2500 [2021-11-05 23:58:40,624 INFO L226 Difference]: Without dead ends: 2486 [2021-11-05 23:58:40,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.74ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:40,626 INFO L933 BasicCegarLoop]: 1349 mSDtfsCounter, 1481 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.06ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.04ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:40,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1481 Valid, 2196 Invalid, 74 Unknown, 0 Unchecked, 3.06ms Time], IncrementalHoareTripleChecker [22 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 62.04ms Time] [2021-11-05 23:58:40,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2021-11-05 23:58:40,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2236. [2021-11-05 23:58:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 2203 states have (on average 1.1774852473899229) internal successors, (2594), 2235 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:40,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2594 transitions. [2021-11-05 23:58:40,789 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2594 transitions. Word has length 120 [2021-11-05 23:58:40,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:40,790 INFO L470 AbstractCegarLoop]: Abstraction has 2236 states and 2594 transitions. [2021-11-05 23:58:40,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:40,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2594 transitions. [2021-11-05 23:58:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-05 23:58:40,792 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:40,792 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:58:40,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-05 23:58:40,793 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr86ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:40,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:40,793 INFO L85 PathProgramCache]: Analyzing trace with hash 818410347, now seen corresponding path program 1 times [2021-11-05 23:58:40,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:40,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297005508] [2021-11-05 23:58:40,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:40,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:40,881 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-05 23:58:40,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:40,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297005508] [2021-11-05 23:58:40,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297005508] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:40,882 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:40,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 23:58:40,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886564784] [2021-11-05 23:58:40,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:40,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:40,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:40,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:40,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:40,884 INFO L87 Difference]: Start difference. First operand 2236 states and 2594 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:41,331 INFO L93 Difference]: Finished difference Result 2766 states and 3216 transitions. [2021-11-05 23:58:41,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 23:58:41,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2021-11-05 23:58:41,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:41,334 INFO L225 Difference]: With dead ends: 2766 [2021-11-05 23:58:41,334 INFO L226 Difference]: Without dead ends: 2752 [2021-11-05 23:58:41,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.07ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:41,336 INFO L933 BasicCegarLoop]: 1639 mSDtfsCounter, 849 mSDsluCounter, 2246 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 216.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 3885 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.63ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 251.91ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:41,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [849 Valid, 3885 Invalid, 93 Unknown, 0 Unchecked, 2.63ms Time], IncrementalHoareTripleChecker [21 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 251.91ms Time] [2021-11-05 23:58:41,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2021-11-05 23:58:41,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2222. [2021-11-05 23:58:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2222 states, 2196 states have (on average 1.1707650273224044) internal successors, (2571), 2221 states have internal predecessors, (2571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 2571 transitions. [2021-11-05 23:58:41,493 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 2571 transitions. Word has length 128 [2021-11-05 23:58:41,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:41,494 INFO L470 AbstractCegarLoop]: Abstraction has 2222 states and 2571 transitions. [2021-11-05 23:58:41,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 2571 transitions. [2021-11-05 23:58:41,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-05 23:58:41,496 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:41,496 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:58:41,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-05 23:58:41,496 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:41,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:41,497 INFO L85 PathProgramCache]: Analyzing trace with hash 124270850, now seen corresponding path program 1 times [2021-11-05 23:58:41,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:41,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400799407] [2021-11-05 23:58:41,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:41,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:41,590 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-05 23:58:41,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:41,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400799407] [2021-11-05 23:58:41,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400799407] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:41,591 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:41,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 23:58:41,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848417421] [2021-11-05 23:58:41,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:41,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 23:58:41,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:41,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 23:58:41,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:41,593 INFO L87 Difference]: Start difference. First operand 2222 states and 2571 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:42,074 INFO L93 Difference]: Finished difference Result 6538 states and 7648 transitions. [2021-11-05 23:58:42,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 23:58:42,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2021-11-05 23:58:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:42,080 INFO L225 Difference]: With dead ends: 6538 [2021-11-05 23:58:42,080 INFO L226 Difference]: Without dead ends: 5357 [2021-11-05 23:58:42,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.56ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 23:58:42,082 INFO L933 BasicCegarLoop]: 2208 mSDtfsCounter, 3154 mSDsluCounter, 5081 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3154 SdHoareTripleChecker+Valid, 7289 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.70ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.25ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:42,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3154 Valid, 7289 Invalid, 82 Unknown, 0 Unchecked, 5.70ms Time], IncrementalHoareTripleChecker [16 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 51.25ms Time] [2021-11-05 23:58:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5357 states. [2021-11-05 23:58:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5357 to 2249. [2021-11-05 23:58:42,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2249 states, 2223 states have (on average 1.1682411156095367) internal successors, (2597), 2248 states have internal predecessors, (2597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 2597 transitions. [2021-11-05 23:58:42,314 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 2597 transitions. Word has length 143 [2021-11-05 23:58:42,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:42,314 INFO L470 AbstractCegarLoop]: Abstraction has 2249 states and 2597 transitions. [2021-11-05 23:58:42,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:42,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 2597 transitions. [2021-11-05 23:58:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-05 23:58:42,317 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:42,317 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:58:42,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-05 23:58:42,318 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:42,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:42,318 INFO L85 PathProgramCache]: Analyzing trace with hash -268756160, now seen corresponding path program 1 times [2021-11-05 23:58:42,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:42,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659108398] [2021-11-05 23:58:42,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:42,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:42,473 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-05 23:58:42,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:42,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659108398] [2021-11-05 23:58:42,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659108398] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:42,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:42,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:42,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602151793] [2021-11-05 23:58:42,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:42,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:42,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:42,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:42,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:42,477 INFO L87 Difference]: Start difference. First operand 2249 states and 2597 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:42,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:42,818 INFO L93 Difference]: Finished difference Result 3192 states and 3695 transitions. [2021-11-05 23:58:42,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 23:58:42,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2021-11-05 23:58:42,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:42,822 INFO L225 Difference]: With dead ends: 3192 [2021-11-05 23:58:42,822 INFO L226 Difference]: Without dead ends: 3190 [2021-11-05 23:58:42,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.95ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:42,823 INFO L933 BasicCegarLoop]: 1627 mSDtfsCounter, 993 mSDsluCounter, 2476 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 4103 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.59ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.96ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:42,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [993 Valid, 4103 Invalid, 70 Unknown, 0 Unchecked, 3.59ms Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 49.96ms Time] [2021-11-05 23:58:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2021-11-05 23:58:43,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 2249. [2021-11-05 23:58:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2249 states, 2223 states have (on average 1.1673414304993253) internal successors, (2595), 2248 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 2595 transitions. [2021-11-05 23:58:43,053 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 2595 transitions. Word has length 143 [2021-11-05 23:58:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:43,054 INFO L470 AbstractCegarLoop]: Abstraction has 2249 states and 2595 transitions. [2021-11-05 23:58:43,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:43,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 2595 transitions. [2021-11-05 23:58:43,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-05 23:58:43,056 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:43,056 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:58:43,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-05 23:58:43,056 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr90ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:43,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:43,057 INFO L85 PathProgramCache]: Analyzing trace with hash -576382556, now seen corresponding path program 1 times [2021-11-05 23:58:43,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:43,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620010361] [2021-11-05 23:58:43,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:43,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:43,264 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-05 23:58:43,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:43,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620010361] [2021-11-05 23:58:43,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620010361] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:43,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:43,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:43,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265748426] [2021-11-05 23:58:43,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:43,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:43,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:43,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:43,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:43,267 INFO L87 Difference]: Start difference. First operand 2249 states and 2595 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:43,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:43,614 INFO L93 Difference]: Finished difference Result 3201 states and 3711 transitions. [2021-11-05 23:58:43,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:43,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2021-11-05 23:58:43,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:43,617 INFO L225 Difference]: With dead ends: 3201 [2021-11-05 23:58:43,617 INFO L226 Difference]: Without dead ends: 2991 [2021-11-05 23:58:43,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.16ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:43,618 INFO L933 BasicCegarLoop]: 1622 mSDtfsCounter, 1618 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.57ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.19ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:43,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1618 Valid, 2579 Invalid, 28 Unknown, 0 Unchecked, 3.57ms Time], IncrementalHoareTripleChecker [12 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 19.19ms Time] [2021-11-05 23:58:43,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2021-11-05 23:58:43,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 2039. [2021-11-05 23:58:43,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2039 states, 2019 states have (on average 1.1679049034175335) internal successors, (2358), 2038 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:43,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 2358 transitions. [2021-11-05 23:58:43,784 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 2358 transitions. Word has length 145 [2021-11-05 23:58:43,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:43,784 INFO L470 AbstractCegarLoop]: Abstraction has 2039 states and 2358 transitions. [2021-11-05 23:58:43,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:43,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2358 transitions. [2021-11-05 23:58:43,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-05 23:58:43,786 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:43,786 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:58:43,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-05 23:58:43,787 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr87ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:43,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:43,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1455645263, now seen corresponding path program 1 times [2021-11-05 23:58:43,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:43,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682149280] [2021-11-05 23:58:43,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:43,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:58:44,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:44,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682149280] [2021-11-05 23:58:44,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682149280] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:44,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:44,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 23:58:44,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127755157] [2021-11-05 23:58:44,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:44,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:44,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:44,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:44,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:44,194 INFO L87 Difference]: Start difference. First operand 2039 states and 2358 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:44,623 INFO L93 Difference]: Finished difference Result 4015 states and 4648 transitions. [2021-11-05 23:58:44,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:44,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2021-11-05 23:58:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:44,627 INFO L225 Difference]: With dead ends: 4015 [2021-11-05 23:58:44,627 INFO L226 Difference]: Without dead ends: 2039 [2021-11-05 23:58:44,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.31ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:44,631 INFO L933 BasicCegarLoop]: 1092 mSDtfsCounter, 88 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 109.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 3033 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.50ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 136.53ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:44,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 3033 Invalid, 157 Unknown, 0 Unchecked, 2.50ms Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 136.53ms Time] [2021-11-05 23:58:44,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2021-11-05 23:58:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2039. [2021-11-05 23:58:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2039 states, 2019 states have (on average 1.1664190193164934) internal successors, (2355), 2038 states have internal predecessors, (2355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 2355 transitions. [2021-11-05 23:58:44,823 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 2355 transitions. Word has length 163 [2021-11-05 23:58:44,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:44,823 INFO L470 AbstractCegarLoop]: Abstraction has 2039 states and 2355 transitions. [2021-11-05 23:58:44,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2355 transitions. [2021-11-05 23:58:44,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-11-05 23:58:44,825 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:44,826 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:58:44,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-05 23:58:44,826 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr87ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:44,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:44,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1894922186, now seen corresponding path program 1 times [2021-11-05 23:58:44,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:44,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007123514] [2021-11-05 23:58:44,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:44,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:45,248 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-05 23:58:45,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:45,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007123514] [2021-11-05 23:58:45,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007123514] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 23:58:45,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547493089] [2021-11-05 23:58:45,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:45,250 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 23:58:45,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 23:58:45,252 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-05 23:58:45,286 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-05 23:58:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:45,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 2140 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-05 23:58:45,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 23:58:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-05 23:58:46,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 23:58:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-05 23:58:46,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547493089] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 23:58:46,739 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-05 23:58:46,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-11-05 23:58:46,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216415357] [2021-11-05 23:58:46,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-05 23:58:46,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 23:58:46,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:46,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 23:58:46,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-05 23:58:46,741 INFO L87 Difference]: Start difference. First operand 2039 states and 2355 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:47,187 INFO L93 Difference]: Finished difference Result 2927 states and 3399 transitions. [2021-11-05 23:58:47,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 23:58:47,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 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 181 [2021-11-05 23:58:47,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:47,192 INFO L225 Difference]: With dead ends: 2927 [2021-11-05 23:58:47,192 INFO L226 Difference]: Without dead ends: 2915 [2021-11-05 23:58:47,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 355 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 33.07ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-05 23:58:47,193 INFO L933 BasicCegarLoop]: 1561 mSDtfsCounter, 2219 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 126.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2219 SdHoareTripleChecker+Valid, 4033 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.23ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 156.12ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:47,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2219 Valid, 4033 Invalid, 85 Unknown, 0 Unchecked, 4.23ms Time], IncrementalHoareTripleChecker [23 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 156.12ms Time] [2021-11-05 23:58:47,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2021-11-05 23:58:47,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 2027. [2021-11-05 23:58:47,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 2013 states have (on average 1.1604570293094882) internal successors, (2336), 2026 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:47,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2336 transitions. [2021-11-05 23:58:47,421 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2336 transitions. Word has length 181 [2021-11-05 23:58:47,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:47,422 INFO L470 AbstractCegarLoop]: Abstraction has 2027 states and 2336 transitions. [2021-11-05 23:58:47,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2336 transitions. [2021-11-05 23:58:47,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-11-05 23:58:47,424 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:47,424 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:58:47,445 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-05 23:58:47,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-11-05 23:58:47,632 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:47,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:47,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1722921435, now seen corresponding path program 1 times [2021-11-05 23:58:47,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:47,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024461956] [2021-11-05 23:58:47,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:47,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-05 23:58:48,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:48,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024461956] [2021-11-05 23:58:48,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024461956] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 23:58:48,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268333758] [2021-11-05 23:58:48,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:48,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 23:58:48,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 23:58:48,358 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-05 23:58:48,360 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-05 23:58:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:48,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 2114 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-05 23:58:48,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 23:58:49,448 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-05 23:58:49,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 23:58:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-05 23:58:49,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268333758] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 23:58:49,863 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-05 23:58:49,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-11-05 23:58:49,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881799827] [2021-11-05 23:58:49,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-05 23:58:49,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 23:58:49,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:49,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 23:58:49,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-05 23:58:49,865 INFO L87 Difference]: Start difference. First operand 2027 states and 2336 transitions. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:50,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:50,161 INFO L93 Difference]: Finished difference Result 2027 states and 2336 transitions. [2021-11-05 23:58:50,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 23:58:50,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 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 192 [2021-11-05 23:58:50,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:50,163 INFO L225 Difference]: With dead ends: 2027 [2021-11-05 23:58:50,163 INFO L226 Difference]: Without dead ends: 1792 [2021-11-05 23:58:50,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 377 SyntacticMatches, 6 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.28ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-05 23:58:50,164 INFO L933 BasicCegarLoop]: 1065 mSDtfsCounter, 900 mSDsluCounter, 3184 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 110.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 4249 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.91ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 128.94ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:50,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [900 Valid, 4249 Invalid, 55 Unknown, 0 Unchecked, 2.91ms Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 128.94ms Time] [2021-11-05 23:58:50,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2021-11-05 23:58:50,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1785. [2021-11-05 23:58:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1785 states, 1772 states have (on average 1.167607223476298) internal successors, (2069), 1784 states have internal predecessors, (2069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2069 transitions. [2021-11-05 23:58:50,308 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2069 transitions. Word has length 192 [2021-11-05 23:58:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:50,308 INFO L470 AbstractCegarLoop]: Abstraction has 1785 states and 2069 transitions. [2021-11-05 23:58:50,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:50,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2069 transitions. [2021-11-05 23:58:50,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-11-05 23:58:50,310 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:50,310 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:58:50,336 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-05 23:58:50,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-11-05 23:58:50,526 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:50,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:50,526 INFO L85 PathProgramCache]: Analyzing trace with hash -766877368, now seen corresponding path program 1 times [2021-11-05 23:58:50,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:50,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295506962] [2021-11-05 23:58:50,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:50,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-05 23:58:50,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:50,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295506962] [2021-11-05 23:58:50,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295506962] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:50,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:50,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:50,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516584968] [2021-11-05 23:58:50,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:50,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 23:58:50,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:50,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 23:58:50,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 23:58:50,619 INFO L87 Difference]: Start difference. First operand 1785 states and 2069 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:50,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:50,936 INFO L93 Difference]: Finished difference Result 5141 states and 5951 transitions. [2021-11-05 23:58:50,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 23:58:50,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 194 [2021-11-05 23:58:50,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:50,943 INFO L225 Difference]: With dead ends: 5141 [2021-11-05 23:58:50,943 INFO L226 Difference]: Without dead ends: 3415 [2021-11-05 23:58:50,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.57ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 23:58:50,947 INFO L933 BasicCegarLoop]: 1184 mSDtfsCounter, 959 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.87ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.41ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:50,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [959 Valid, 2212 Invalid, 8 Unknown, 0 Unchecked, 1.87ms Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 6.41ms Time] [2021-11-05 23:58:50,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3415 states. [2021-11-05 23:58:51,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3415 to 1788. [2021-11-05 23:58:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1775 states have (on average 1.1673239436619718) internal successors, (2072), 1787 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2072 transitions. [2021-11-05 23:58:51,185 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2072 transitions. Word has length 194 [2021-11-05 23:58:51,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:51,185 INFO L470 AbstractCegarLoop]: Abstraction has 1788 states and 2072 transitions. [2021-11-05 23:58:51,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2072 transitions. [2021-11-05 23:58:51,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-11-05 23:58:51,187 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:51,188 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:58:51,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-05 23:58:51,188 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:51,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:51,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1714929334, now seen corresponding path program 1 times [2021-11-05 23:58:51,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:51,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596400414] [2021-11-05 23:58:51,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:51,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:51,369 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-05 23:58:51,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:51,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596400414] [2021-11-05 23:58:51,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596400414] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:51,370 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:51,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 23:58:51,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056418554] [2021-11-05 23:58:51,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:51,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:51,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:51,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:51,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:51,373 INFO L87 Difference]: Start difference. First operand 1788 states and 2072 transitions. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:51,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:51,901 INFO L93 Difference]: Finished difference Result 4881 states and 5659 transitions. [2021-11-05 23:58:51,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:58:51,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 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 194 [2021-11-05 23:58:51,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:51,907 INFO L225 Difference]: With dead ends: 4881 [2021-11-05 23:58:51,907 INFO L226 Difference]: Without dead ends: 3152 [2021-11-05 23:58:51,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.35ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:51,910 INFO L933 BasicCegarLoop]: 1089 mSDtfsCounter, 1855 mSDsluCounter, 2140 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1855 SdHoareTripleChecker+Valid, 3229 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.57ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.30ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:51,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1855 Valid, 3229 Invalid, 18 Unknown, 0 Unchecked, 4.57ms Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 15.30ms Time] [2021-11-05 23:58:51,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3152 states. [2021-11-05 23:58:52,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3152 to 1766. [2021-11-05 23:58:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1753 states have (on average 1.1620079863091843) internal successors, (2037), 1765 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2037 transitions. [2021-11-05 23:58:52,139 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2037 transitions. Word has length 194 [2021-11-05 23:58:52,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:52,140 INFO L470 AbstractCegarLoop]: Abstraction has 1766 states and 2037 transitions. [2021-11-05 23:58:52,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2037 transitions. [2021-11-05 23:58:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-11-05 23:58:52,141 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:52,142 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:58:52,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-05 23:58:52,142 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:52,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:52,143 INFO L85 PathProgramCache]: Analyzing trace with hash 217813787, now seen corresponding path program 1 times [2021-11-05 23:58:52,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:52,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237185405] [2021-11-05 23:58:52,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:52,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 23:58:52,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:52,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237185405] [2021-11-05 23:58:52,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237185405] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:52,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:52,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 23:58:52,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033281192] [2021-11-05 23:58:52,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:52,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 23:58:52,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:52,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 23:58:52,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 23:58:52,344 INFO L87 Difference]: Start difference. First operand 1766 states and 2037 transitions. Second operand has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:53,003 INFO L93 Difference]: Finished difference Result 5722 states and 6653 transitions. [2021-11-05 23:58:53,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-05 23:58:53,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 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 218 [2021-11-05 23:58:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:53,009 INFO L225 Difference]: With dead ends: 5722 [2021-11-05 23:58:53,009 INFO L226 Difference]: Without dead ends: 4592 [2021-11-05 23:58:53,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 65.79ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-05 23:58:53,011 INFO L933 BasicCegarLoop]: 1278 mSDtfsCounter, 3420 mSDsluCounter, 5620 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3420 SdHoareTripleChecker+Valid, 6898 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.79ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 69.48ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:53,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3420 Valid, 6898 Invalid, 77 Unknown, 0 Unchecked, 6.79ms Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 69.48ms Time] [2021-11-05 23:58:53,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4592 states. [2021-11-05 23:58:53,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4592 to 1784. [2021-11-05 23:58:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1771 states have (on average 1.160361377752682) internal successors, (2055), 1783 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:53,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2055 transitions. [2021-11-05 23:58:53,205 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2055 transitions. Word has length 218 [2021-11-05 23:58:53,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:53,205 INFO L470 AbstractCegarLoop]: Abstraction has 1784 states and 2055 transitions. [2021-11-05 23:58:53,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2055 transitions. [2021-11-05 23:58:53,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2021-11-05 23:58:53,206 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:53,207 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:58:53,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-05 23:58:53,207 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:53,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:53,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1399097338, now seen corresponding path program 1 times [2021-11-05 23:58:53,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:53,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897673178] [2021-11-05 23:58:53,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:53,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:53,574 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-05 23:58:53,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:53,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897673178] [2021-11-05 23:58:53,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897673178] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 23:58:53,575 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881546218] [2021-11-05 23:58:53,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:53,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 23:58:53,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 23:58:53,576 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-05 23:58:53,597 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-05 23:58:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:54,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 2498 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-05 23:58:54,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 23:58:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 23:58:54,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 23:58:54,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881546218] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:54,607 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-05 23:58:54,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2021-11-05 23:58:54,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596008729] [2021-11-05 23:58:54,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:54,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 23:58:54,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:54,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 23:58:54,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-05 23:58:54,609 INFO L87 Difference]: Start difference. First operand 1784 states and 2055 transitions. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:55,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:55,187 INFO L93 Difference]: Finished difference Result 2688 states and 3115 transitions. [2021-11-05 23:58:55,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 23:58:55,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 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 220 [2021-11-05 23:58:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:55,191 INFO L225 Difference]: With dead ends: 2688 [2021-11-05 23:58:55,191 INFO L226 Difference]: Without dead ends: 2676 [2021-11-05 23:58:55,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 108.02ms TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-11-05 23:58:55,192 INFO L933 BasicCegarLoop]: 1544 mSDtfsCounter, 1491 mSDsluCounter, 2455 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 212.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 3999 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.89ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 246.98ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:55,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1491 Valid, 3999 Invalid, 130 Unknown, 0 Unchecked, 3.89ms Time], IncrementalHoareTripleChecker [26 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 246.98ms Time] [2021-11-05 23:58:55,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2021-11-05 23:58:55,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 1772. [2021-11-05 23:58:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1765 states have (on average 1.1541076487252124) internal successors, (2037), 1771 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:55,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2037 transitions. [2021-11-05 23:58:55,386 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2037 transitions. Word has length 220 [2021-11-05 23:58:55,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:55,387 INFO L470 AbstractCegarLoop]: Abstraction has 1772 states and 2037 transitions. [2021-11-05 23:58:55,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:55,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2037 transitions. [2021-11-05 23:58:55,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2021-11-05 23:58:55,389 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:55,389 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:58:55,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-05 23:58:55,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 23:58:55,590 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:55,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:55,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1337114123, now seen corresponding path program 1 times [2021-11-05 23:58:55,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:55,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227334374] [2021-11-05 23:58:55,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:55,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 23:58:55,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:55,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227334374] [2021-11-05 23:58:55,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227334374] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:55,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:55,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 23:58:55,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575021932] [2021-11-05 23:58:55,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:55,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:55,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:55,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:55,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:55,737 INFO L87 Difference]: Start difference. First operand 1772 states and 2037 transitions. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:56,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:56,237 INFO L93 Difference]: Finished difference Result 2260 states and 2614 transitions. [2021-11-05 23:58:56,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 23:58:56,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 242 [2021-11-05 23:58:56,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:56,241 INFO L225 Difference]: With dead ends: 2260 [2021-11-05 23:58:56,241 INFO L226 Difference]: Without dead ends: 2254 [2021-11-05 23:58:56,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.37ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:56,242 INFO L933 BasicCegarLoop]: 1586 mSDtfsCounter, 808 mSDsluCounter, 2143 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 175.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 3729 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.05ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 211.71ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:56,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [808 Valid, 3729 Invalid, 50 Unknown, 0 Unchecked, 3.05ms Time], IncrementalHoareTripleChecker [13 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 211.71ms Time] [2021-11-05 23:58:56,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2021-11-05 23:58:56,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1766. [2021-11-05 23:58:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1762 states have (on average 1.1509648127128262) internal successors, (2028), 1765 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2028 transitions. [2021-11-05 23:58:56,490 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2028 transitions. Word has length 242 [2021-11-05 23:58:56,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:56,490 INFO L470 AbstractCegarLoop]: Abstraction has 1766 states and 2028 transitions. [2021-11-05 23:58:56,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:56,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2028 transitions. [2021-11-05 23:58:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2021-11-05 23:58:56,492 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:56,492 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:58:56,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-05 23:58:56,493 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:56,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:56,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1126999311, now seen corresponding path program 1 times [2021-11-05 23:58:56,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:56,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429681316] [2021-11-05 23:58:56,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:56,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 23:58:56,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:56,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429681316] [2021-11-05 23:58:56,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429681316] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:56,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:56,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:58:56,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525570824] [2021-11-05 23:58:56,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:56,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 23:58:56,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:56,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 23:58:56,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 23:58:56,653 INFO L87 Difference]: Start difference. First operand 1766 states and 2028 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:56,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:56,939 INFO L93 Difference]: Finished difference Result 3512 states and 4064 transitions. [2021-11-05 23:58:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 23:58:56,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 247 [2021-11-05 23:58:56,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:56,942 INFO L225 Difference]: With dead ends: 3512 [2021-11-05 23:58:56,943 INFO L226 Difference]: Without dead ends: 2382 [2021-11-05 23:58:56,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.14ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 23:58:56,944 INFO L933 BasicCegarLoop]: 1209 mSDtfsCounter, 332 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 2236 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.79ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.60ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:56,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 2236 Invalid, 8 Unknown, 0 Unchecked, 1.79ms Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 9.60ms Time] [2021-11-05 23:58:56,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2021-11-05 23:58:57,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 1870. [2021-11-05 23:58:57,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1866 states have (on average 1.1554126473740622) internal successors, (2156), 1869 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2156 transitions. [2021-11-05 23:58:57,156 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2156 transitions. Word has length 247 [2021-11-05 23:58:57,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:57,156 INFO L470 AbstractCegarLoop]: Abstraction has 1870 states and 2156 transitions. [2021-11-05 23:58:57,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2156 transitions. [2021-11-05 23:58:57,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2021-11-05 23:58:57,158 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:57,159 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:58:57,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-05 23:58:57,159 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:57,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:57,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1650451, now seen corresponding path program 1 times [2021-11-05 23:58:57,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:57,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548770327] [2021-11-05 23:58:57,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:57,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 23:58:57,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:57,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548770327] [2021-11-05 23:58:57,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548770327] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:57,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:57,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 23:58:57,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494915294] [2021-11-05 23:58:57,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:57,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 23:58:57,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:57,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 23:58:57,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:57,403 INFO L87 Difference]: Start difference. First operand 1870 states and 2156 transitions. Second operand has 5 states, 5 states have (on average 47.2) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:57,883 INFO L93 Difference]: Finished difference Result 3670 states and 4269 transitions. [2021-11-05 23:58:57,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 23:58:57,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.2) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 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 250 [2021-11-05 23:58:57,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:57,887 INFO L225 Difference]: With dead ends: 3670 [2021-11-05 23:58:57,888 INFO L226 Difference]: Without dead ends: 2436 [2021-11-05 23:58:57,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 24.00ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 23:58:57,890 INFO L933 BasicCegarLoop]: 1633 mSDtfsCounter, 2031 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2031 SdHoareTripleChecker+Valid, 3777 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.47ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.11ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:57,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2031 Valid, 3777 Invalid, 9 Unknown, 0 Unchecked, 4.47ms Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 8.11ms Time] [2021-11-05 23:58:57,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2021-11-05 23:58:58,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 1870. [2021-11-05 23:58:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1866 states have (on average 1.1543408360128617) internal successors, (2154), 1869 states have internal predecessors, (2154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:58,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2154 transitions. [2021-11-05 23:58:58,155 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2154 transitions. Word has length 250 [2021-11-05 23:58:58,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:58,155 INFO L470 AbstractCegarLoop]: Abstraction has 1870 states and 2154 transitions. [2021-11-05 23:58:58,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.2) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:58,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2154 transitions. [2021-11-05 23:58:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2021-11-05 23:58:58,157 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:58,157 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:58:58,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-05 23:58:58,157 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:58,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:58,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1710033, now seen corresponding path program 1 times [2021-11-05 23:58:58,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:58,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875351354] [2021-11-05 23:58:58,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:58,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 23:58:58,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:58,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875351354] [2021-11-05 23:58:58,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875351354] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:58,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:58,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 23:58:58,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172812229] [2021-11-05 23:58:58,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:58,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:58:58,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:58,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:58:58,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:58:58,285 INFO L87 Difference]: Start difference. First operand 1870 states and 2154 transitions. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:58,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:58:58,608 INFO L93 Difference]: Finished difference Result 2439 states and 2821 transitions. [2021-11-05 23:58:58,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 23:58:58,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 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 250 [2021-11-05 23:58:58,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:58:58,611 INFO L225 Difference]: With dead ends: 2439 [2021-11-05 23:58:58,611 INFO L226 Difference]: Without dead ends: 2437 [2021-11-05 23:58:58,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.96ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:58,614 INFO L933 BasicCegarLoop]: 1635 mSDtfsCounter, 1280 mSDsluCounter, 1989 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 3624 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.82ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.68ms IncrementalHoareTripleChecker+Time [2021-11-05 23:58:58,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1280 Valid, 3624 Invalid, 5 Unknown, 0 Unchecked, 2.82ms Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 4.68ms Time] [2021-11-05 23:58:58,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2021-11-05 23:58:58,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1868. [2021-11-05 23:58:58,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1865 states have (on average 1.1533512064343163) internal successors, (2151), 1867 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:58,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2151 transitions. [2021-11-05 23:58:58,841 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2151 transitions. Word has length 250 [2021-11-05 23:58:58,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:58:58,841 INFO L470 AbstractCegarLoop]: Abstraction has 1868 states and 2151 transitions. [2021-11-05 23:58:58,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:58:58,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2151 transitions. [2021-11-05 23:58:58,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2021-11-05 23:58:58,843 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:58:58,844 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:58:58,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-05 23:58:58,844 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:58:58,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:58:58,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1851659248, now seen corresponding path program 1 times [2021-11-05 23:58:58,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:58:58,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121765433] [2021-11-05 23:58:58,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:58:58,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:58:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:58:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-05 23:58:59,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:58:59,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121765433] [2021-11-05 23:58:59,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121765433] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:58:59,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:58:59,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 23:58:59,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076217708] [2021-11-05 23:58:59,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:58:59,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 23:58:59,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:58:59,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 23:58:59,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:58:59,778 INFO L87 Difference]: Start difference. First operand 1868 states and 2151 transitions. Second operand has 5 states, 5 states have (on average 47.2) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:59:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:59:00,431 INFO L93 Difference]: Finished difference Result 1868 states and 2151 transitions. [2021-11-05 23:59:00,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 23:59:00,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.2) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 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 250 [2021-11-05 23:59:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:59:00,433 INFO L225 Difference]: With dead ends: 1868 [2021-11-05 23:59:00,433 INFO L226 Difference]: Without dead ends: 1736 [2021-11-05 23:59:00,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.46ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-05 23:59:00,434 INFO L933 BasicCegarLoop]: 1029 mSDtfsCounter, 811 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 376.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 3086 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.63ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 422.89ms IncrementalHoareTripleChecker+Time [2021-11-05 23:59:00,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [811 Valid, 3086 Invalid, 85 Unknown, 0 Unchecked, 2.63ms Time], IncrementalHoareTripleChecker [10 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 422.89ms Time] [2021-11-05 23:59:00,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2021-11-05 23:59:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1549. [2021-11-05 23:59:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1547 states have (on average 1.1622495151906918) internal successors, (1798), 1548 states have internal predecessors, (1798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:59:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 1798 transitions. [2021-11-05 23:59:00,617 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 1798 transitions. Word has length 250 [2021-11-05 23:59:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:59:00,617 INFO L470 AbstractCegarLoop]: Abstraction has 1549 states and 1798 transitions. [2021-11-05 23:59:00,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.2) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:59:00,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1798 transitions. [2021-11-05 23:59:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-11-05 23:59:00,619 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:59:00,619 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:59:00,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-05 23:59:00,619 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:59:00,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:59:00,620 INFO L85 PathProgramCache]: Analyzing trace with hash -589682853, now seen corresponding path program 1 times [2021-11-05 23:59:00,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:59:00,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160758925] [2021-11-05 23:59:00,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:59:00,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:59:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:59:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 23:59:00,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:59:00,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160758925] [2021-11-05 23:59:00,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160758925] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:59:00,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:59:00,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-05 23:59:00,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467743808] [2021-11-05 23:59:00,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:59:00,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 23:59:00,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:59:00,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 23:59:00,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 23:59:00,810 INFO L87 Difference]: Start difference. First operand 1549 states and 1798 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:59:01,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:59:01,005 INFO L93 Difference]: Finished difference Result 2645 states and 3088 transitions. [2021-11-05 23:59:01,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 23:59:01,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2021-11-05 23:59:01,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:59:01,007 INFO L225 Difference]: With dead ends: 2645 [2021-11-05 23:59:01,007 INFO L226 Difference]: Without dead ends: 1545 [2021-11-05 23:59:01,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.55ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 23:59:01,009 INFO L933 BasicCegarLoop]: 1043 mSDtfsCounter, 808 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.11ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.91ms IncrementalHoareTripleChecker+Time [2021-11-05 23:59:01,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [808 Valid, 1043 Invalid, 1 Unknown, 0 Unchecked, 1.11ms Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.91ms Time] [2021-11-05 23:59:01,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2021-11-05 23:59:01,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1545. [2021-11-05 23:59:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.1599740932642486) internal successors, (1791), 1544 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:59:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1791 transitions. [2021-11-05 23:59:01,226 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1791 transitions. Word has length 253 [2021-11-05 23:59:01,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:59:01,226 INFO L470 AbstractCegarLoop]: Abstraction has 1545 states and 1791 transitions. [2021-11-05 23:59:01,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:59:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1791 transitions. [2021-11-05 23:59:01,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2021-11-05 23:59:01,228 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:59:01,228 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:59:01,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-05 23:59:01,229 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:59:01,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:59:01,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1539343555, now seen corresponding path program 1 times [2021-11-05 23:59:01,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:59:01,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089084175] [2021-11-05 23:59:01,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:59:01,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:59:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:59:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 23:59:01,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:59:01,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089084175] [2021-11-05 23:59:01,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089084175] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:59:01,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:59:01,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:59:01,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536636437] [2021-11-05 23:59:01,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:59:01,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 23:59:01,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:59:01,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 23:59:01,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 23:59:01,386 INFO L87 Difference]: Start difference. First operand 1545 states and 1791 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:59:01,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:59:01,716 INFO L93 Difference]: Finished difference Result 3533 states and 4135 transitions. [2021-11-05 23:59:01,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 23:59:01,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 345 [2021-11-05 23:59:01,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:59:01,718 INFO L225 Difference]: With dead ends: 3533 [2021-11-05 23:59:01,718 INFO L226 Difference]: Without dead ends: 2437 [2021-11-05 23:59:01,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.46ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 23:59:01,720 INFO L933 BasicCegarLoop]: 1555 mSDtfsCounter, 534 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 2572 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.85ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.66ms IncrementalHoareTripleChecker+Time [2021-11-05 23:59:01,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 2572 Invalid, 6 Unknown, 0 Unchecked, 1.85ms Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 8.66ms Time] [2021-11-05 23:59:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2021-11-05 23:59:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1547. [2021-11-05 23:59:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1546 states have (on average 1.1597671410090555) internal successors, (1793), 1546 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:59:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 1793 transitions. [2021-11-05 23:59:01,919 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 1793 transitions. Word has length 345 [2021-11-05 23:59:01,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:59:01,919 INFO L470 AbstractCegarLoop]: Abstraction has 1547 states and 1793 transitions. [2021-11-05 23:59:01,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:59:01,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1793 transitions. [2021-11-05 23:59:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2021-11-05 23:59:01,921 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:59:01,921 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:59:01,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-05 23:59:01,922 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:59:01,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:59:01,922 INFO L85 PathProgramCache]: Analyzing trace with hash 396841089, now seen corresponding path program 1 times [2021-11-05 23:59:01,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:59:01,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675125570] [2021-11-05 23:59:01,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:59:01,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:59:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:59:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 23:59:02,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:59:02,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675125570] [2021-11-05 23:59:02,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675125570] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:59:02,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:59:02,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-05 23:59:02,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441929368] [2021-11-05 23:59:02,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:59:02,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 23:59:02,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:59:02,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 23:59:02,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-05 23:59:02,164 INFO L87 Difference]: Start difference. First operand 1547 states and 1793 transitions. Second operand has 8 states, 8 states have (on average 41.375) internal successors, (331), 8 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:59:03,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:59:03,010 INFO L93 Difference]: Finished difference Result 4573 states and 5355 transitions. [2021-11-05 23:59:03,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-05 23:59:03,011 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 41.375) internal successors, (331), 8 states have internal predecessors, (331), 0 states have call successors, (0), 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 345 [2021-11-05 23:59:03,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:59:03,014 INFO L225 Difference]: With dead ends: 4573 [2021-11-05 23:59:03,015 INFO L226 Difference]: Without dead ends: 3475 [2021-11-05 23:59:03,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 102.90ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-05 23:59:03,016 INFO L933 BasicCegarLoop]: 1618 mSDtfsCounter, 6020 mSDsluCounter, 6824 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 108.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6020 SdHoareTripleChecker+Valid, 8442 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.37ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 120.04ms IncrementalHoareTripleChecker+Time [2021-11-05 23:59:03,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6020 Valid, 8442 Invalid, 51 Unknown, 0 Unchecked, 9.37ms Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 120.04ms Time] [2021-11-05 23:59:03,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3475 states. [2021-11-05 23:59:03,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3475 to 1559. [2021-11-05 23:59:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1558 states have (on average 1.1585365853658536) internal successors, (1805), 1558 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:59:03,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 1805 transitions. [2021-11-05 23:59:03,235 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 1805 transitions. Word has length 345 [2021-11-05 23:59:03,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:59:03,235 INFO L470 AbstractCegarLoop]: Abstraction has 1559 states and 1805 transitions. [2021-11-05 23:59:03,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 41.375) internal successors, (331), 8 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:59:03,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1805 transitions. [2021-11-05 23:59:03,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2021-11-05 23:59:03,238 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:59:03,238 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:59:03,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-05 23:59:03,238 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:59:03,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:59:03,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1610548403, now seen corresponding path program 1 times [2021-11-05 23:59:03,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:59:03,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354416175] [2021-11-05 23:59:03,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:59:03,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:59:03,291 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 23:59:03,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [82227376] [2021-11-05 23:59:03,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:59:03,292 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 23:59:03,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 23:59:03,293 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-05 23:59:03,294 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-05 23:59:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:59:03,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 3475 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-05 23:59:03,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 23:59:04,662 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 23:59:04,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 23:59:04,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:59:04,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354416175] [2021-11-05 23:59:04,663 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 23:59:04,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82227376] [2021-11-05 23:59:04,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82227376] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:59:04,663 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:59:04,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-05 23:59:04,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383974750] [2021-11-05 23:59:04,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:59:04,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 23:59:04,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:59:04,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 23:59:04,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-05 23:59:04,665 INFO L87 Difference]: Start difference. First operand 1559 states and 1805 transitions. Second operand has 8 states, 8 states have (on average 42.125) internal successors, (337), 8 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:59:05,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:59:05,317 INFO L93 Difference]: Finished difference Result 3732 states and 4354 transitions. [2021-11-05 23:59:05,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-05 23:59:05,318 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 42.125) internal successors, (337), 8 states have internal predecessors, (337), 0 states have call successors, (0), 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 351 [2021-11-05 23:59:05,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:59:05,322 INFO L225 Difference]: With dead ends: 3732 [2021-11-05 23:59:05,322 INFO L226 Difference]: Without dead ends: 3114 [2021-11-05 23:59:05,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 81.90ms TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-11-05 23:59:05,324 INFO L933 BasicCegarLoop]: 1951 mSDtfsCounter, 5457 mSDsluCounter, 6636 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5457 SdHoareTripleChecker+Valid, 8587 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.15ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.51ms IncrementalHoareTripleChecker+Time [2021-11-05 23:59:05,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5457 Valid, 8587 Invalid, 50 Unknown, 0 Unchecked, 9.15ms Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 33.51ms Time] [2021-11-05 23:59:05,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2021-11-05 23:59:05,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 1562. [2021-11-05 23:59:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1561 states have (on average 1.1582319026265215) internal successors, (1808), 1561 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:59:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 1808 transitions. [2021-11-05 23:59:05,575 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 1808 transitions. Word has length 351 [2021-11-05 23:59:05,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:59:05,576 INFO L470 AbstractCegarLoop]: Abstraction has 1562 states and 1808 transitions. [2021-11-05 23:59:05,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.125) internal successors, (337), 8 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:59:05,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1808 transitions. [2021-11-05 23:59:05,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2021-11-05 23:59:05,578 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:59:05,578 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:59:05,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-05 23:59:05,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 23:59:05,780 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:59:05,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:59:05,781 INFO L85 PathProgramCache]: Analyzing trace with hash 91074321, now seen corresponding path program 1 times [2021-11-05 23:59:05,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:59:05,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143632082] [2021-11-05 23:59:05,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:59:05,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:59:05,851 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 23:59:05,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1196623465] [2021-11-05 23:59:05,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:59:05,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 23:59:05,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 23:59:05,853 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-05 23:59:05,854 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-05 23:59:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:59:07,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 3624 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-05 23:59:07,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 23:59:08,218 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-05 23:59:08,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2021-11-05 23:59:08,272 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-05 23:59:08,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 55 [2021-11-05 23:59:09,456 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-05 23:59:09,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2021-11-05 23:59:09,718 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-05 23:59:09,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 23:59:24,497 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_3 Int) (v_ULTIMATE.start_seq_next_~pos.offset_3 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_3 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_3))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_3 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_3) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_3) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) is different from false [2021-11-05 23:59:26,528 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_3 Int) (v_ULTIMATE.start_seq_next_~pos.offset_3 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_3 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_3))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_3 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_3) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base v_ULTIMATE.start_seq_next_~pos.base_3) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) is different from false [2021-11-05 23:59:28,660 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_3 Int) (v_ULTIMATE.start_seq_next_~pos.offset_3 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_3 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_3))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_3 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_3) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_3) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) is different from false [2021-11-05 23:59:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 20 not checked. [2021-11-05 23:59:30,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:59:30,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143632082] [2021-11-05 23:59:30,573 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 23:59:30,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196623465] [2021-11-05 23:59:30,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196623465] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 23:59:30,573 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-05 23:59:30,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-11-05 23:59:30,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185176235] [2021-11-05 23:59:30,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-05 23:59:30,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-05 23:59:30,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:59:30,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-05 23:59:30,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=9, NotChecked=72, Total=240 [2021-11-05 23:59:30,575 INFO L87 Difference]: Start difference. First operand 1562 states and 1808 transitions. Second operand has 16 states, 16 states have (on average 35.5) internal successors, (568), 15 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:59:33,073 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (forall ((v_ULTIMATE.start_seq_next_~pos.base_3 Int) (v_ULTIMATE.start_seq_next_~pos.offset_3 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_3 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_3))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_3 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_3) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_3) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-05 23:59:35,122 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< (+ c_ULTIMATE.start_ldv_xmalloc_~res~4.base 1) |c_~#nfnl_log_net_id~0.base|) (forall ((v_ULTIMATE.start_seq_next_~pos.base_3 Int) (v_ULTIMATE.start_seq_next_~pos.offset_3 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_3 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_3))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_3 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_3) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base v_ULTIMATE.start_seq_next_~pos.base_3) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0))))))) is different from false [2021-11-05 23:59:37,131 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< (+ |c_ULTIMATE.start_ldv_xmalloc_#res.base| 1) |c_~#nfnl_log_net_id~0.base|) (forall ((v_ULTIMATE.start_seq_next_~pos.base_3 Int) (v_ULTIMATE.start_seq_next_~pos.offset_3 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_3 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_3))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_3 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_3) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_3) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0))))))) is different from false [2021-11-05 23:59:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:59:38,027 INFO L93 Difference]: Finished difference Result 3029 states and 3511 transitions. [2021-11-05 23:59:38,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-05 23:59:38,028 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 35.5) internal successors, (568), 15 states have internal predecessors, (568), 0 states have call successors, (0), 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 363 [2021-11-05 23:59:38,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:59:38,030 INFO L225 Difference]: With dead ends: 3029 [2021-11-05 23:59:38,030 INFO L226 Difference]: Without dead ends: 1907 [2021-11-05 23:59:38,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 711 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 24305.16ms TimeCoverageRelationStatistics Valid=60, Invalid=162, Unknown=12, NotChecked=186, Total=420 [2021-11-05 23:59:38,032 INFO L933 BasicCegarLoop]: 953 mSDtfsCounter, 428 mSDsluCounter, 8839 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 907.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 9792 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.39ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1234 IncrementalHoareTripleChecker+Unchecked, 966.69ms IncrementalHoareTripleChecker+Time [2021-11-05 23:59:38,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [428 Valid, 9792 Invalid, 1461 Unknown, 0 Unchecked, 13.39ms Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 1234 Unchecked, 966.69ms Time] [2021-11-05 23:59:38,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2021-11-05 23:59:38,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1871. [2021-11-05 23:59:38,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1870 states have (on average 1.153475935828877) internal successors, (2157), 1870 states have internal predecessors, (2157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:59:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2157 transitions. [2021-11-05 23:59:38,346 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2157 transitions. Word has length 363 [2021-11-05 23:59:38,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:59:38,346 INFO L470 AbstractCegarLoop]: Abstraction has 1871 states and 2157 transitions. [2021-11-05 23:59:38,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 35.5) internal successors, (568), 15 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:59:38,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2157 transitions. [2021-11-05 23:59:38,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2021-11-05 23:59:38,348 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:59:38,349 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:59:38,380 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-05 23:59:38,550 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,SelfDestructingSolverStorable52 [2021-11-05 23:59:38,551 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-05 23:59:38,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:59:38,551 INFO L85 PathProgramCache]: Analyzing trace with hash -552621421, now seen corresponding path program 1 times [2021-11-05 23:59:38,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:59:38,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211668629] [2021-11-05 23:59:38,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:59:38,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:59:38,610 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 23:59:38,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1227682170] [2021-11-05 23:59:38,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:59:38,610 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 23:59:38,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 23:59:38,612 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-05 23:59:38,613 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-05 23:59:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:59:40,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 3623 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-05 23:59:40,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 23:59:40,923 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-05 23:59:40,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2021-11-05 23:59:40,974 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-05 23:59:40,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 55 [2021-11-05 23:59:41,966 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-05 23:59:41,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2021-11-05 23:59:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-05 23:59:42,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 23:59:56,939 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_4 Int) (v_ULTIMATE.start_seq_next_~pos.offset_4 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_4 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_4))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_4 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_4) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_4) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= (mod .cse3 4294967296) 15)))))) is different from false [2021-11-05 23:59:58,971 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_4 Int) (v_ULTIMATE.start_seq_next_~pos.offset_4 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_4 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_4))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_4 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_4) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base v_ULTIMATE.start_seq_next_~pos.base_4) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= (mod .cse3 4294967296) 15)))))) is different from false [2021-11-06 00:00:01,095 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_4 Int) (v_ULTIMATE.start_seq_next_~pos.offset_4 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_4 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_4))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_4 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_4) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_4) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= (mod .cse3 4294967296) 15)))))) is different from false [2021-11-06 00:00:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 20 not checked. [2021-11-06 00:00:02,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:00:02,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211668629] [2021-11-06 00:00:02,892 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:00:02,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227682170] [2021-11-06 00:00:02,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227682170] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:00:02,893 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:00:02,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-11-06 00:00:02,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409179977] [2021-11-06 00:00:02,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:00:02,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 00:00:02,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:00:02,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 00:00:02,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=9, NotChecked=72, Total=240 [2021-11-06 00:00:02,896 INFO L87 Difference]: Start difference. First operand 1871 states and 2157 transitions. Second operand has 16 states, 16 states have (on average 35.5) internal successors, (568), 15 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:00:05,341 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (forall ((v_ULTIMATE.start_seq_next_~pos.base_4 Int) (v_ULTIMATE.start_seq_next_~pos.offset_4 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_4 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_4))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_4 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_4) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_4) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= (mod .cse3 4294967296) 15)))))) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:00:07,398 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< (+ c_ULTIMATE.start_ldv_xmalloc_~res~4.base 1) |c_~#nfnl_log_net_id~0.base|) (forall ((v_ULTIMATE.start_seq_next_~pos.base_4 Int) (v_ULTIMATE.start_seq_next_~pos.offset_4 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_4 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_4))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_4 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_4) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base v_ULTIMATE.start_seq_next_~pos.base_4) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= (mod .cse3 4294967296) 15))))))) is different from false [2021-11-06 00:00:09,406 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (forall ((v_ULTIMATE.start_seq_next_~pos.base_4 Int) (v_ULTIMATE.start_seq_next_~pos.offset_4 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_4 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_4))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_4 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_4) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_4) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= (mod .cse3 4294967296) 15)))))) (< (+ |c_ULTIMATE.start_ldv_xmalloc_#res.base| 1) |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:00:10,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:00:10,556 INFO L93 Difference]: Finished difference Result 3525 states and 4079 transitions. [2021-11-06 00:00:10,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 00:00:10,556 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 35.5) internal successors, (568), 15 states have internal predecessors, (568), 0 states have call successors, (0), 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 363 [2021-11-06 00:00:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:00:10,559 INFO L225 Difference]: With dead ends: 3525 [2021-11-06 00:00:10,559 INFO L226 Difference]: Without dead ends: 2403 [2021-11-06 00:00:10,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 711 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 24317.55ms TimeCoverageRelationStatistics Valid=60, Invalid=162, Unknown=12, NotChecked=186, Total=420 [2021-11-06 00:00:10,561 INFO L933 BasicCegarLoop]: 1430 mSDtfsCounter, 849 mSDsluCounter, 13898 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1068.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 15328 SdHoareTripleChecker+Invalid, 2993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.42ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2467 IncrementalHoareTripleChecker+Unchecked, 1175.58ms IncrementalHoareTripleChecker+Time [2021-11-06 00:00:10,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [849 Valid, 15328 Invalid, 2993 Unknown, 0 Unchecked, 11.42ms Time], IncrementalHoareTripleChecker [1 Valid, 525 Invalid, 0 Unknown, 2467 Unchecked, 1175.58ms Time] [2021-11-06 00:00:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2021-11-06 00:00:10,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 2291. [2021-11-06 00:00:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2291 states, 2290 states have (on average 1.1563318777292577) internal successors, (2648), 2290 states have internal predecessors, (2648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:00:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 2648 transitions. [2021-11-06 00:00:10,955 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 2648 transitions. Word has length 363 [2021-11-06 00:00:10,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:00:10,955 INFO L470 AbstractCegarLoop]: Abstraction has 2291 states and 2648 transitions. [2021-11-06 00:00:10,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 35.5) internal successors, (568), 15 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:00:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 2648 transitions. [2021-11-06 00:00:10,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2021-11-06 00:00:10,959 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:00:10,959 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:00:10,999 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 00:00:11,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:00:11,168 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:00:11,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:00:11,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1808909911, now seen corresponding path program 1 times [2021-11-06 00:00:11,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:00:11,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725337355] [2021-11-06 00:00:11,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:00:11,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:00:11,239 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:00:11,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1383625272] [2021-11-06 00:00:11,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:00:11,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:00:11,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:00:11,240 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 00:00:11,241 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 00:00:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:00:11,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 3648 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-06 00:00:11,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:00:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-06 00:00:12,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:00:12,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:00:12,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725337355] [2021-11-06 00:00:12,541 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:00:12,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383625272] [2021-11-06 00:00:12,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383625272] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:00:12,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:00:12,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 00:00:12,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708004174] [2021-11-06 00:00:12,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:00:12,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 00:00:12,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:00:12,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 00:00:12,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-06 00:00:12,544 INFO L87 Difference]: Start difference. First operand 2291 states and 2648 transitions. Second operand has 12 states, 12 states have (on average 29.0) internal successors, (348), 12 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:00:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:00:13,177 INFO L93 Difference]: Finished difference Result 3815 states and 4413 transitions. [2021-11-06 00:00:13,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 00:00:13,178 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 29.0) internal successors, (348), 12 states have internal predecessors, (348), 0 states have call successors, (0), 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 364 [2021-11-06 00:00:13,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:00:13,180 INFO L225 Difference]: With dead ends: 3815 [2021-11-06 00:00:13,180 INFO L226 Difference]: Without dead ends: 2283 [2021-11-06 00:00:13,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 153.11ms TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2021-11-06 00:00:13,183 INFO L933 BasicCegarLoop]: 1046 mSDtfsCounter, 83 mSDsluCounter, 10220 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 137.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 11266 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.78ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 167.65ms IncrementalHoareTripleChecker+Time [2021-11-06 00:00:13,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 11266 Invalid, 239 Unknown, 0 Unchecked, 5.78ms Time], IncrementalHoareTripleChecker [12 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 167.65ms Time] [2021-11-06 00:00:13,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2021-11-06 00:00:13,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2283. [2021-11-06 00:00:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2283 states, 2282 states have (on average 1.154250657318142) internal successors, (2634), 2282 states have internal predecessors, (2634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:00:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 2634 transitions. [2021-11-06 00:00:13,568 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 2634 transitions. Word has length 364 [2021-11-06 00:00:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:00:13,569 INFO L470 AbstractCegarLoop]: Abstraction has 2283 states and 2634 transitions. [2021-11-06 00:00:13,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 29.0) internal successors, (348), 12 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:00:13,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 2634 transitions. [2021-11-06 00:00:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2021-11-06 00:00:13,572 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:00:13,572 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:00:13,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-11-06 00:00:13,772 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,SelfDestructingSolverStorable54 [2021-11-06 00:00:13,773 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:00:13,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:00:13,773 INFO L85 PathProgramCache]: Analyzing trace with hash 775521138, now seen corresponding path program 1 times [2021-11-06 00:00:13,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:00:13,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103562737] [2021-11-06 00:00:13,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:00:13,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:00:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:00:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-06 00:00:13,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:00:13,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103562737] [2021-11-06 00:00:13,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103562737] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:00:13,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:00:13,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:00:13,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282488535] [2021-11-06 00:00:13,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:00:13,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:00:13,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:00:13,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:00:13,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:00:13,939 INFO L87 Difference]: Start difference. First operand 2283 states and 2634 transitions. Second operand has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:00:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:00:14,418 INFO L93 Difference]: Finished difference Result 3882 states and 4548 transitions. [2021-11-06 00:00:14,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:00:14,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 365 [2021-11-06 00:00:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:00:14,422 INFO L225 Difference]: With dead ends: 3882 [2021-11-06 00:00:14,423 INFO L226 Difference]: Without dead ends: 2564 [2021-11-06 00:00:14,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.94ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:00:14,425 INFO L933 BasicCegarLoop]: 1199 mSDtfsCounter, 402 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 2801 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.48ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.94ms IncrementalHoareTripleChecker+Time [2021-11-06 00:00:14,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 2801 Invalid, 59 Unknown, 0 Unchecked, 2.48ms Time], IncrementalHoareTripleChecker [15 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 62.94ms Time] [2021-11-06 00:00:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2021-11-06 00:00:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2371. [2021-11-06 00:00:14,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 2370 states have (on average 1.161181434599156) internal successors, (2752), 2370 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:00:14,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 2752 transitions. [2021-11-06 00:00:14,798 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 2752 transitions. Word has length 365 [2021-11-06 00:00:14,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:00:14,798 INFO L470 AbstractCegarLoop]: Abstraction has 2371 states and 2752 transitions. [2021-11-06 00:00:14,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:00:14,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 2752 transitions. [2021-11-06 00:00:14,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2021-11-06 00:00:14,802 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:00:14,802 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:00:14,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-11-06 00:00:14,802 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:00:14,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:00:14,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1756475952, now seen corresponding path program 1 times [2021-11-06 00:00:14,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:00:14,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484896532] [2021-11-06 00:00:14,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:00:14,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:00:14,853 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:00:14,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [72585067] [2021-11-06 00:00:14,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:00:14,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:00:14,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:00:14,855 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 00:00:14,856 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 00:00:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:00:17,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 3627 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-06 00:00:17,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:00:17,568 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-06 00:00:17,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2021-11-06 00:00:17,622 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-06 00:00:17,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 55 [2021-11-06 00:00:18,539 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-06 00:00:18,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2021-11-06 00:00:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 00:00:18,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:00:33,554 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_5 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_5 Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_5 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_5))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_5 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_5) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_5)))))) is different from false [2021-11-06 00:00:35,590 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_5 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_5 Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_5 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_5))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_5 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_5) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base v_ULTIMATE.start_seq_next_~pos.base_5)))))) is different from false [2021-11-06 00:00:37,749 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_5 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_5 Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_5 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_5))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_5 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_5) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_5)))))) is different from false [2021-11-06 00:00:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 20 not checked. [2021-11-06 00:00:40,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:00:40,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484896532] [2021-11-06 00:00:40,198 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:00:40,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72585067] [2021-11-06 00:00:40,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72585067] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:00:40,198 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:00:40,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-11-06 00:00:40,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601487392] [2021-11-06 00:00:40,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:00:40,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 00:00:40,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:00:40,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 00:00:40,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=9, NotChecked=72, Total=240 [2021-11-06 00:00:40,200 INFO L87 Difference]: Start difference. First operand 2371 states and 2752 transitions. Second operand has 16 states, 16 states have (on average 35.75) internal successors, (572), 15 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:00:42,626 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_seq_next_~pos.base_5 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_5 Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_5 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_5))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_5 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_5) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_5)))))) (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:00:44,672 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< (+ c_ULTIMATE.start_ldv_xmalloc_~res~4.base 1) |c_~#nfnl_log_net_id~0.base|) (forall ((v_ULTIMATE.start_seq_next_~pos.base_5 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_5 Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_5 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_5))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_5 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_5) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base v_ULTIMATE.start_seq_next_~pos.base_5))))))) is different from false [2021-11-06 00:00:46,678 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_seq_next_~pos.base_5 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_5 Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_5 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_5))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_5 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_5) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_5)))))) (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< (+ |c_ULTIMATE.start_ldv_xmalloc_#res.base| 1) |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:00:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:00:47,633 INFO L93 Difference]: Finished difference Result 3719 states and 4348 transitions. [2021-11-06 00:00:47,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 00:00:47,634 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 35.75) internal successors, (572), 15 states have internal predecessors, (572), 0 states have call successors, (0), 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 365 [2021-11-06 00:00:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:00:47,637 INFO L225 Difference]: With dead ends: 3719 [2021-11-06 00:00:47,637 INFO L226 Difference]: Without dead ends: 2531 [2021-11-06 00:00:47,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 714 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 24336.81ms TimeCoverageRelationStatistics Valid=60, Invalid=162, Unknown=12, NotChecked=186, Total=420 [2021-11-06 00:00:47,640 INFO L933 BasicCegarLoop]: 955 mSDtfsCounter, 318 mSDsluCounter, 10757 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 812.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 11712 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.25ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1382 IncrementalHoareTripleChecker+Unchecked, 945.02ms IncrementalHoareTripleChecker+Time [2021-11-06 00:00:47,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 11712 Invalid, 1742 Unknown, 0 Unchecked, 8.25ms Time], IncrementalHoareTripleChecker [1 Valid, 359 Invalid, 0 Unknown, 1382 Unchecked, 945.02ms Time] [2021-11-06 00:00:47,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2021-11-06 00:00:48,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2405. [2021-11-06 00:00:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 2404 states have (on average 1.163893510815308) internal successors, (2798), 2404 states have internal predecessors, (2798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:00:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 2798 transitions. [2021-11-06 00:00:48,006 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 2798 transitions. Word has length 365 [2021-11-06 00:00:48,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:00:48,006 INFO L470 AbstractCegarLoop]: Abstraction has 2405 states and 2798 transitions. [2021-11-06 00:00:48,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 35.75) internal successors, (572), 15 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:00:48,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 2798 transitions. [2021-11-06 00:00:48,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2021-11-06 00:00:48,010 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:00:48,010 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:00:48,045 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 00:00:48,211 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,SelfDestructingSolverStorable56 [2021-11-06 00:00:48,211 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:00:48,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:00:48,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1907928135, now seen corresponding path program 1 times [2021-11-06 00:00:48,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:00:48,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908545858] [2021-11-06 00:00:48,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:00:48,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:00:48,260 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:00:48,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [514989736] [2021-11-06 00:00:48,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:00:48,261 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:00:48,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:00:48,262 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 00:00:48,262 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 00:00:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:00:49,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 3707 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-06 00:00:49,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:00:50,307 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-06 00:00:50,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2021-11-06 00:00:50,354 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-06 00:00:50,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 55 [2021-11-06 00:00:51,335 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-06 00:00:51,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2021-11-06 00:00:51,557 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 00:00:51,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:01:06,284 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_6 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_6 Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_6 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_6))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_6 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_6) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_6) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= (mod .cse3 4294967296) 15)))))) is different from false [2021-11-06 00:01:08,311 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_6 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_6 Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_6 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_6))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_6 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_6) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base v_ULTIMATE.start_seq_next_~pos.base_6) (<= (mod .cse3 4294967296) 15)))))) is different from false [2021-11-06 00:01:10,429 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_6 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_6 Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_6 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_6))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_6 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_6) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_6) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= (mod .cse3 4294967296) 15)))))) is different from false [2021-11-06 00:01:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 20 not checked. [2021-11-06 00:01:12,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:01:12,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908545858] [2021-11-06 00:01:12,468 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:01:12,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514989736] [2021-11-06 00:01:12,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514989736] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:01:12,468 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:01:12,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-11-06 00:01:12,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057424415] [2021-11-06 00:01:12,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:01:12,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 00:01:12,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:01:12,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 00:01:12,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=9, NotChecked=72, Total=240 [2021-11-06 00:01:12,469 INFO L87 Difference]: Start difference. First operand 2405 states and 2798 transitions. Second operand has 16 states, 16 states have (on average 36.75) internal successors, (588), 15 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:01:14,825 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|) (forall ((v_ULTIMATE.start_seq_next_~pos.base_6 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_6 Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_6 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_6))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_6 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_6) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_6) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= (mod .cse3 4294967296) 15))))))) is different from false [2021-11-06 00:01:16,864 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< (+ c_ULTIMATE.start_ldv_xmalloc_~res~4.base 1) |c_~#nfnl_log_net_id~0.base|) (forall ((v_ULTIMATE.start_seq_next_~pos.base_6 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_6 Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_6 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_6))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_6 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_6) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base v_ULTIMATE.start_seq_next_~pos.base_6) (<= (mod .cse3 4294967296) 15))))))) is different from false [2021-11-06 00:01:18,875 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (forall ((v_ULTIMATE.start_seq_next_~pos.base_6 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_6 Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_6 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_6))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_6 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_6) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_6) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= (mod .cse3 4294967296) 15)))))) (< (+ |c_ULTIMATE.start_ldv_xmalloc_#res.base| 1) |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:01:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:01:19,556 INFO L93 Difference]: Finished difference Result 3783 states and 4430 transitions. [2021-11-06 00:01:19,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 00:01:19,557 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 36.75) internal successors, (588), 15 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 373 [2021-11-06 00:01:19,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:01:19,559 INFO L225 Difference]: With dead ends: 3783 [2021-11-06 00:01:19,559 INFO L226 Difference]: Without dead ends: 2595 [2021-11-06 00:01:19,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 731 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 24356.50ms TimeCoverageRelationStatistics Valid=60, Invalid=162, Unknown=12, NotChecked=186, Total=420 [2021-11-06 00:01:19,561 INFO L933 BasicCegarLoop]: 944 mSDtfsCounter, 629 mSDsluCounter, 7940 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 500.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 8884 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.86ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1280 IncrementalHoareTripleChecker+Unchecked, 534.34ms IncrementalHoareTripleChecker+Time [2021-11-06 00:01:19,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 8884 Invalid, 1448 Unknown, 0 Unchecked, 6.86ms Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 1280 Unchecked, 534.34ms Time] [2021-11-06 00:01:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2021-11-06 00:01:19,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2435. [2021-11-06 00:01:19,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2435 states, 2434 states have (on average 1.1643385373870172) internal successors, (2834), 2434 states have internal predecessors, (2834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:01:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 2834 transitions. [2021-11-06 00:01:19,932 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 2834 transitions. Word has length 373 [2021-11-06 00:01:19,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:01:19,932 INFO L470 AbstractCegarLoop]: Abstraction has 2435 states and 2834 transitions. [2021-11-06 00:01:19,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 36.75) internal successors, (588), 15 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:01:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 2834 transitions. [2021-11-06 00:01:19,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2021-11-06 00:01:19,936 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:01:19,936 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:01:19,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-11-06 00:01:20,136 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,SelfDestructingSolverStorable57 [2021-11-06 00:01:20,137 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:01:20,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:01:20,137 INFO L85 PathProgramCache]: Analyzing trace with hash 421727147, now seen corresponding path program 1 times [2021-11-06 00:01:20,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:01:20,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627142310] [2021-11-06 00:01:20,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:01:20,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:01:20,198 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:01:20,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2010808410] [2021-11-06 00:01:20,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:01:20,199 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:01:20,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:01:20,200 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 00:01:20,201 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 00:01:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:01:22,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 3728 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-06 00:01:22,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:01:22,466 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-06 00:01:22,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2021-11-06 00:01:22,887 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-06 00:01:22,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2021-11-06 00:01:22,936 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-06 00:01:22,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 55 [2021-11-06 00:01:23,992 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-06 00:01:23,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2021-11-06 00:01:24,230 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 00:01:24,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:01:43,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_7 Int) (v_ULTIMATE.start_seq_next_~pos.base_7 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_7 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_7))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_7 (+ 1 (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_7))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_7)))))) is different from false [2021-11-06 00:01:45,110 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_7 Int) (v_ULTIMATE.start_seq_next_~pos.base_7 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_7 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_7))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_7 (+ 1 (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_7))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base v_ULTIMATE.start_seq_next_~pos.base_7)))))) is different from false [2021-11-06 00:01:47,233 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_7 Int) (v_ULTIMATE.start_seq_next_~pos.base_7 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_7 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_7))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_7 (+ 1 (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_7))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_7) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) is different from false [2021-11-06 00:01:51,654 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_4 Int) (v_ULTIMATE.start_seq_next_~pos.offset_7 Int) (v_ULTIMATE.start_seq_next_~pos.base_7 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_DerPreprocessor_1 Int)) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base|) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_4 v_DerPreprocessor_1)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_7 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_7))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_7 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_7) 1))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_7) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) is different from false [2021-11-06 00:01:53,706 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_4 Int) (v_ULTIMATE.start_seq_next_~pos.offset_7 Int) (v_ULTIMATE.start_seq_next_~pos.base_7 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_DerPreprocessor_1 Int)) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base (store (select |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_4 v_DerPreprocessor_1)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_7 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_7))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_7 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_7) 1))))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_7) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= (mod .cse3 4294967296) 15)))))) is different from false [2021-11-06 00:01:55,926 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_4 Int) (v_ULTIMATE.start_seq_next_~pos.offset_7 Int) (v_ULTIMATE.start_seq_next_~pos.base_7 Int) (v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_150 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_DerPreprocessor_1 Int)) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_150 (store (select |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_150) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_4 v_DerPreprocessor_1)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_7 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_7))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_7 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_7) 1))))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_7) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_150) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= (mod .cse3 4294967296) 15)))))) is different from false [2021-11-06 00:01:56,508 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 20 not checked. [2021-11-06 00:01:56,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:01:56,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627142310] [2021-11-06 00:01:56,509 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:01:56,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010808410] [2021-11-06 00:01:56,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010808410] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:01:56,509 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:01:56,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2021-11-06 00:01:56,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905179380] [2021-11-06 00:01:56,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:01:56,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-06 00:01:56,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:01:56,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-06 00:01:56,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=156, Unknown=14, NotChecked=186, Total=420 [2021-11-06 00:01:56,511 INFO L87 Difference]: Start difference. First operand 2435 states and 2834 transitions. Second operand has 21 states, 21 states have (on average 28.095238095238095) internal successors, (590), 20 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:01:58,838 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_4 Int) (v_ULTIMATE.start_seq_next_~pos.offset_7 Int) (v_ULTIMATE.start_seq_next_~pos.base_7 Int) (v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_150 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_DerPreprocessor_1 Int)) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_150 (store (select |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_150) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_4 v_DerPreprocessor_1)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_7 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_7))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_7 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_7) 1))))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_7) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_150) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= (mod .cse3 4294967296) 15)))))) (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:02:00,848 WARN L838 $PredicateComparison]: unable to prove that (and (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base |c_#StackHeapBarrier|) (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (forall ((v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_4 Int) (v_ULTIMATE.start_seq_next_~pos.offset_7 Int) (v_ULTIMATE.start_seq_next_~pos.base_7 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_DerPreprocessor_1 Int)) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base (store (select |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_4 v_DerPreprocessor_1)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_7 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_7))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_7 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_7) 1))))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_7) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= (mod .cse3 4294967296) 15)))))) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:02:02,859 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_4 Int) (v_ULTIMATE.start_seq_next_~pos.offset_7 Int) (v_ULTIMATE.start_seq_next_~pos.base_7 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_DerPreprocessor_1 Int)) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base|) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_4 v_DerPreprocessor_1)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_7 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_7))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_7 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_7) 1))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_7) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| |c_#StackHeapBarrier|)) is different from false [2021-11-06 00:02:04,865 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (forall ((v_ULTIMATE.start_seq_next_~pos.offset_7 Int) (v_ULTIMATE.start_seq_next_~pos.base_7 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_7 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_7))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_7 (+ 1 (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_7))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_7) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:02:06,946 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_seq_next_~pos.offset_7 Int) (v_ULTIMATE.start_seq_next_~pos.base_7 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_7 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_7))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_7 (+ 1 (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_7))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base v_ULTIMATE.start_seq_next_~pos.base_7)))))) (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< (+ c_ULTIMATE.start_ldv_xmalloc_~res~4.base 1) |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:02:08,967 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_seq_next_~pos.offset_7 Int) (v_ULTIMATE.start_seq_next_~pos.base_7 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_7 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_7))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_7 (+ 1 (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_7))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_7)))))) (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< (+ |c_ULTIMATE.start_ldv_xmalloc_#res.base| 1) |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:02:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:02:10,330 INFO L93 Difference]: Finished difference Result 4620 states and 5363 transitions. [2021-11-06 00:02:10,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-06 00:02:10,331 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 28.095238095238095) internal successors, (590), 20 states have internal predecessors, (590), 0 states have call successors, (0), 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 374 [2021-11-06 00:02:10,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:02:10,335 INFO L225 Difference]: With dead ends: 4620 [2021-11-06 00:02:10,335 INFO L226 Difference]: Without dead ends: 3432 [2021-11-06 00:02:10,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 755 GetRequests, 727 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 40458.74ms TimeCoverageRelationStatistics Valid=86, Invalid=214, Unknown=20, NotChecked=492, Total=812 [2021-11-06 00:02:10,337 INFO L933 BasicCegarLoop]: 1530 mSDtfsCounter, 1075 mSDsluCounter, 16690 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 931.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 18220 SdHoareTripleChecker+Invalid, 7520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.83ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6751 IncrementalHoareTripleChecker+Unchecked, 1123.67ms IncrementalHoareTripleChecker+Time [2021-11-06 00:02:10,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1075 Valid, 18220 Invalid, 7520 Unknown, 0 Unchecked, 15.83ms Time], IncrementalHoareTripleChecker [2 Valid, 767 Invalid, 0 Unknown, 6751 Unchecked, 1123.67ms Time] [2021-11-06 00:02:10,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2021-11-06 00:02:10,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 2748. [2021-11-06 00:02:10,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2748 states, 2747 states have (on average 1.1590826356024755) internal successors, (3184), 2747 states have internal predecessors, (3184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:02:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2748 states and 3184 transitions. [2021-11-06 00:02:10,760 INFO L78 Accepts]: Start accepts. Automaton has 2748 states and 3184 transitions. Word has length 374 [2021-11-06 00:02:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:02:10,760 INFO L470 AbstractCegarLoop]: Abstraction has 2748 states and 3184 transitions. [2021-11-06 00:02:10,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 28.095238095238095) internal successors, (590), 20 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:02:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 3184 transitions. [2021-11-06 00:02:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2021-11-06 00:02:10,764 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:02:10,764 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:02:10,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-11-06 00:02:10,964 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,SelfDestructingSolverStorable58 [2021-11-06 00:02:10,964 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:02:10,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:02:10,965 INFO L85 PathProgramCache]: Analyzing trace with hash -221968595, now seen corresponding path program 1 times [2021-11-06 00:02:10,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:02:10,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637768822] [2021-11-06 00:02:10,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:02:10,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:02:11,012 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:02:11,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1707188457] [2021-11-06 00:02:11,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:02:11,012 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:02:11,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:02:11,013 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 00:02:11,014 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 00:02:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:02:13,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 3727 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-06 00:02:13,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:02:13,639 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-06 00:02:13,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2021-11-06 00:02:14,110 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-06 00:02:14,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2021-11-06 00:02:14,158 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-06 00:02:14,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 55 [2021-11-06 00:02:15,009 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-06 00:02:15,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2021-11-06 00:02:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 00:02:15,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:02:34,038 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_8 Int) (v_ULTIMATE.start_seq_next_~pos.base_8 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_8 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_8))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_8 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_8) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_8) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= (mod .cse3 4294967296) 15)))))) is different from false [2021-11-06 00:02:36,068 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_8 Int) (v_ULTIMATE.start_seq_next_~pos.base_8 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_8 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_8))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_8 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_8) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base v_ULTIMATE.start_seq_next_~pos.base_8) (<= (mod .cse3 4294967296) 15)))))) is different from false [2021-11-06 00:02:38,222 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_8 Int) (v_ULTIMATE.start_seq_next_~pos.base_8 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_8 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_8))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_8 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_8) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_8) (<= (mod .cse3 4294967296) 15)))))) is different from false [2021-11-06 00:02:42,919 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_8 Int) (v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_6 Int) (v_ULTIMATE.start_seq_next_~pos.base_8 Int) (v_DerPreprocessor_2 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base|) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_6 v_DerPreprocessor_2)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_8 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_8))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_8 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_8) 1))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_8) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) is different from false [2021-11-06 00:02:44,971 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_8 Int) (v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_6 Int) (v_ULTIMATE.start_seq_next_~pos.base_8 Int) (v_DerPreprocessor_2 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base (store (select |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_6 v_DerPreprocessor_2)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_8 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_8))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_8 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_8) 1))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_8) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) is different from false [2021-11-06 00:02:47,269 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_8 Int) (v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_6 Int) (v_ULTIMATE.start_seq_next_~pos.base_8 Int) (v_DerPreprocessor_2 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_164 Int)) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_164 (store (select |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_164) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_6 v_DerPreprocessor_2)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_8 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_8))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_8 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_8) 1))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_164) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_8)))))) is different from false [2021-11-06 00:02:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 20 not checked. [2021-11-06 00:02:48,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:02:48,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637768822] [2021-11-06 00:02:48,129 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:02:48,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707188457] [2021-11-06 00:02:48,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707188457] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:02:48,129 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:02:48,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2021-11-06 00:02:48,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593451668] [2021-11-06 00:02:48,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:02:48,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-06 00:02:48,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:02:48,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-06 00:02:48,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=156, Unknown=14, NotChecked=186, Total=420 [2021-11-06 00:02:48,130 INFO L87 Difference]: Start difference. First operand 2748 states and 3184 transitions. Second operand has 21 states, 21 states have (on average 28.095238095238095) internal successors, (590), 20 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:02:50,273 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (forall ((v_ULTIMATE.start_seq_next_~pos.offset_8 Int) (v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_6 Int) (v_ULTIMATE.start_seq_next_~pos.base_8 Int) (v_DerPreprocessor_2 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_164 Int)) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_164 (store (select |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_164) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_6 v_DerPreprocessor_2)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_8 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_8))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_8 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_8) 1))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_164) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_8)))))) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:02:52,281 WARN L838 $PredicateComparison]: unable to prove that (and (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base |c_#StackHeapBarrier|) (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (forall ((v_ULTIMATE.start_seq_next_~pos.offset_8 Int) (v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_6 Int) (v_ULTIMATE.start_seq_next_~pos.base_8 Int) (v_DerPreprocessor_2 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base (store (select |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_6 v_DerPreprocessor_2)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_8 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_8))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_8 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_8) 1))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_8) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:02:54,293 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (forall ((v_ULTIMATE.start_seq_next_~pos.offset_8 Int) (v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_6 Int) (v_ULTIMATE.start_seq_next_~pos.base_8 Int) (v_DerPreprocessor_2 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base|) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_6 v_DerPreprocessor_2)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_8 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_8))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_8 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_8) 1))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_8) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| |c_#StackHeapBarrier|)) is different from false [2021-11-06 00:02:56,303 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (forall ((v_ULTIMATE.start_seq_next_~pos.offset_8 Int) (v_ULTIMATE.start_seq_next_~pos.base_8 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_8 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_8))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_8 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_8) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_8) (<= (mod .cse3 4294967296) 15)))))) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:02:58,378 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< (+ c_ULTIMATE.start_ldv_xmalloc_~res~4.base 1) |c_~#nfnl_log_net_id~0.base|) (forall ((v_ULTIMATE.start_seq_next_~pos.offset_8 Int) (v_ULTIMATE.start_seq_next_~pos.base_8 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_8 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_8))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_8 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_8) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base v_ULTIMATE.start_seq_next_~pos.base_8) (<= (mod .cse3 4294967296) 15))))))) is different from false [2021-11-06 00:03:00,400 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_seq_next_~pos.offset_8 Int) (v_ULTIMATE.start_seq_next_~pos.base_8 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_8 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_8))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_8 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_8) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_8) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= (mod .cse3 4294967296) 15)))))) (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< (+ |c_ULTIMATE.start_ldv_xmalloc_#res.base| 1) |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:03:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:03:01,554 INFO L93 Difference]: Finished difference Result 4896 states and 5666 transitions. [2021-11-06 00:03:01,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-06 00:03:01,555 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 28.095238095238095) internal successors, (590), 20 states have internal predecessors, (590), 0 states have call successors, (0), 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 374 [2021-11-06 00:03:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:03:01,559 INFO L225 Difference]: With dead ends: 4896 [2021-11-06 00:03:01,560 INFO L226 Difference]: Without dead ends: 3387 [2021-11-06 00:03:01,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 726 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 40523.25ms TimeCoverageRelationStatistics Valid=113, Invalid=295, Unknown=20, NotChecked=564, Total=992 [2021-11-06 00:03:01,562 INFO L933 BasicCegarLoop]: 1343 mSDtfsCounter, 1163 mSDsluCounter, 14983 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 558.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 16326 SdHoareTripleChecker+Invalid, 5287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.07ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4849 IncrementalHoareTripleChecker+Unchecked, 652.45ms IncrementalHoareTripleChecker+Time [2021-11-06 00:03:01,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1163 Valid, 16326 Invalid, 5287 Unknown, 0 Unchecked, 14.07ms Time], IncrementalHoareTripleChecker [4 Valid, 434 Invalid, 0 Unknown, 4849 Unchecked, 652.45ms Time] [2021-11-06 00:03:01,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states. [2021-11-06 00:03:02,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 2841. [2021-11-06 00:03:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2841 states, 2840 states have (on average 1.157394366197183) internal successors, (3287), 2840 states have internal predecessors, (3287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:03:02,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 3287 transitions. [2021-11-06 00:03:02,044 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 3287 transitions. Word has length 374 [2021-11-06 00:03:02,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:03:02,045 INFO L470 AbstractCegarLoop]: Abstraction has 2841 states and 3287 transitions. [2021-11-06 00:03:02,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 28.095238095238095) internal successors, (590), 20 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:03:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 3287 transitions. [2021-11-06 00:03:02,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2021-11-06 00:03:02,048 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:03:02,048 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:03:02,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-11-06 00:03:02,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:03:02,249 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:03:02,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:03:02,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2006448494, now seen corresponding path program 1 times [2021-11-06 00:03:02,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:03:02,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941345727] [2021-11-06 00:03:02,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:03:02,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:03:02,304 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:03:02,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [745443546] [2021-11-06 00:03:02,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:03:02,305 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:03:02,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:03:02,306 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 00:03:02,332 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 00:03:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:03:04,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 3716 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-06 00:03:04,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:03:04,684 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-06 00:03:04,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2021-11-06 00:03:05,194 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-06 00:03:05,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2021-11-06 00:03:05,246 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-06 00:03:05,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 55 [2021-11-06 00:03:06,460 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-06 00:03:06,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2021-11-06 00:03:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 00:03:06,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:03:25,587 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_9 Int) (v_ULTIMATE.start_seq_next_~pos.base_9 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_9 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_9))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_9 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_9) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_9)))))) is different from false [2021-11-06 00:03:27,648 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_9 Int) (v_ULTIMATE.start_seq_next_~pos.base_9 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_9 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_9))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_9 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_9) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base v_ULTIMATE.start_seq_next_~pos.base_9) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) is different from false [2021-11-06 00:03:29,934 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_9 Int) (v_ULTIMATE.start_seq_next_~pos.base_9 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_9 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_9))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_9 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_9) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_9) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) is different from false [2021-11-06 00:03:34,552 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_9 Int) (v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_8 Int) (v_ULTIMATE.start_seq_next_~pos.base_9 Int) (v_DerPreprocessor_3 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base|) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_8 v_DerPreprocessor_3)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_9 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_9))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_9 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_9) 1))))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_9) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= (mod .cse3 4294967296) 15)))))) is different from false [2021-11-06 00:03:36,596 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_9 Int) (v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_8 Int) (v_ULTIMATE.start_seq_next_~pos.base_9 Int) (v_DerPreprocessor_3 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base (store (select |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_8 v_DerPreprocessor_3)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_9 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_9))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_9 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_9) 1))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_9) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) is different from false [2021-11-06 00:03:38,839 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_9 Int) (v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_8 Int) (v_ULTIMATE.start_seq_next_~pos.base_9 Int) (v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_178 Int) (v_DerPreprocessor_3 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_178 (store (select |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_178) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_8 v_DerPreprocessor_3)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_9 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_9))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_9 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_9) 1))))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_9) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_178) (<= (mod .cse3 4294967296) 15)))))) is different from false [2021-11-06 00:03:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 20 not checked. [2021-11-06 00:03:39,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:03:39,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941345727] [2021-11-06 00:03:39,562 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:03:39,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745443546] [2021-11-06 00:03:39,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745443546] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:03:39,563 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:03:39,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2021-11-06 00:03:39,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124710719] [2021-11-06 00:03:39,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:03:39,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-06 00:03:39,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:03:39,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-06 00:03:39,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=156, Unknown=14, NotChecked=186, Total=420 [2021-11-06 00:03:39,565 INFO L87 Difference]: Start difference. First operand 2841 states and 3287 transitions. Second operand has 21 states, 21 states have (on average 28.095238095238095) internal successors, (590), 20 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:03:42,469 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_seq_next_~pos.offset_9 Int) (v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_8 Int) (v_ULTIMATE.start_seq_next_~pos.base_9 Int) (v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_178 Int) (v_DerPreprocessor_3 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_178 (store (select |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_178) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_8 v_DerPreprocessor_3)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_9 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_9))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_9 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_9) 1))))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_9) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_178) (<= (mod .cse3 4294967296) 15)))))) (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:03:44,478 WARN L838 $PredicateComparison]: unable to prove that (and (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base |c_#StackHeapBarrier|) (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|) (forall ((v_ULTIMATE.start_seq_next_~pos.offset_9 Int) (v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_8 Int) (v_ULTIMATE.start_seq_next_~pos.base_9 Int) (v_DerPreprocessor_3 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base (store (select |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_8 v_DerPreprocessor_3)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_9 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_9))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_9 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_9) 1))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_9) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0))))))) is different from false [2021-11-06 00:03:46,488 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_seq_next_~pos.offset_9 Int) (v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_8 Int) (v_ULTIMATE.start_seq_next_~pos.base_9 Int) (v_DerPreprocessor_3 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base|) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_8 v_DerPreprocessor_3)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_9 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_9))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_9 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_9) 1))))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ (select .cse1 .cse2) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_9) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= (mod .cse3 4294967296) 15)))))) (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| |c_#StackHeapBarrier|)) is different from false [2021-11-06 00:03:48,496 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (forall ((v_ULTIMATE.start_seq_next_~pos.offset_9 Int) (v_ULTIMATE.start_seq_next_~pos.base_9 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_9 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_9))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_9 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_9) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_9) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:03:50,576 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< (+ c_ULTIMATE.start_ldv_xmalloc_~res~4.base 1) |c_~#nfnl_log_net_id~0.base|) (forall ((v_ULTIMATE.start_seq_next_~pos.offset_9 Int) (v_ULTIMATE.start_seq_next_~pos.base_9 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_9 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_9))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_9 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_9) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base v_ULTIMATE.start_seq_next_~pos.base_9) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0))))))) is different from false [2021-11-06 00:03:52,597 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_seq_next_~pos.offset_9 Int) (v_ULTIMATE.start_seq_next_~pos.base_9 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_9 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_9))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_9 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_9) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_9)))))) (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< (+ |c_ULTIMATE.start_ldv_xmalloc_#res.base| 1) |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:03:53,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:03:53,570 INFO L93 Difference]: Finished difference Result 4429 states and 5133 transitions. [2021-11-06 00:03:53,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 00:03:53,571 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 28.095238095238095) internal successors, (590), 20 states have internal predecessors, (590), 0 states have call successors, (0), 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 374 [2021-11-06 00:03:53,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:03:53,576 INFO L225 Difference]: With dead ends: 4429 [2021-11-06 00:03:53,576 INFO L226 Difference]: Without dead ends: 3241 [2021-11-06 00:03:53,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 755 GetRequests, 727 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 40573.79ms TimeCoverageRelationStatistics Valid=86, Invalid=214, Unknown=20, NotChecked=492, Total=812 [2021-11-06 00:03:53,579 INFO L933 BasicCegarLoop]: 1353 mSDtfsCounter, 595 mSDsluCounter, 13964 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1143.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 15317 SdHoareTripleChecker+Invalid, 3631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.64ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3229 IncrementalHoareTripleChecker+Unchecked, 1344.86ms IncrementalHoareTripleChecker+Time [2021-11-06 00:03:53,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [595 Valid, 15317 Invalid, 3631 Unknown, 0 Unchecked, 11.64ms Time], IncrementalHoareTripleChecker [2 Valid, 400 Invalid, 0 Unknown, 3229 Unchecked, 1344.86ms Time] [2021-11-06 00:03:53,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2021-11-06 00:03:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 2953. [2021-11-06 00:03:54,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2952 states have (on average 1.1554878048780488) internal successors, (3411), 2952 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:03:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3411 transitions. [2021-11-06 00:03:54,066 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3411 transitions. Word has length 374 [2021-11-06 00:03:54,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:03:54,066 INFO L470 AbstractCegarLoop]: Abstraction has 2953 states and 3411 transitions. [2021-11-06 00:03:54,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 28.095238095238095) internal successors, (590), 20 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:03:54,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3411 transitions. [2021-11-06 00:03:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2021-11-06 00:03:54,069 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:03:54,070 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:03:54,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-11-06 00:03:54,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:03:54,270 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:03:54,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:03:54,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1362752752, now seen corresponding path program 1 times [2021-11-06 00:03:54,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:03:54,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980054107] [2021-11-06 00:03:54,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:03:54,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:03:54,319 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:03:54,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1004372892] [2021-11-06 00:03:54,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:03:54,320 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:03:54,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:03:54,321 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 00:03:54,323 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 00:03:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:03:56,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 3715 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-06 00:03:56,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:03:56,776 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-06 00:03:56,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2021-11-06 00:03:57,229 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-06 00:03:57,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2021-11-06 00:03:57,278 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-06 00:03:57,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 55 [2021-11-06 00:03:58,191 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-06 00:03:58,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2021-11-06 00:03:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 00:03:58,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:04:17,219 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_10 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_10 Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_10 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_10))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_10 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_10) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_10) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) is different from false [2021-11-06 00:04:19,259 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_10 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_10 Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_10 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_10))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_10 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_10) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base v_ULTIMATE.start_seq_next_~pos.base_10) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) is different from false [2021-11-06 00:04:21,426 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_10 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_10 Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_10 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_10))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_10 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_10) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_10) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) is different from false [2021-11-06 00:04:25,604 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_10 Int) (v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_10 Int) (v_DerPreprocessor_4 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_10 Int)) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base|) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_10 v_DerPreprocessor_4)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_10 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_10))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_10 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_10) 1))))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ 1 (select .cse1 .cse2)))) (or (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_10) (<= (mod .cse3 4294967296) 15)))))) is different from false [2021-11-06 00:04:27,650 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_10 Int) (v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_10 Int) (v_DerPreprocessor_4 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_10 Int)) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base (store (select |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_10 v_DerPreprocessor_4)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_10 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_10))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_10 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_10) 1))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_10)))))) is different from false [2021-11-06 00:04:29,932 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_10 Int) (v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_10 Int) (v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_192 Int) (v_DerPreprocessor_4 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_10 Int)) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_192 (store (select |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_192) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_10 v_DerPreprocessor_4)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_10 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_10))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_10 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_10) 1))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_192) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_10)))))) is different from false [2021-11-06 00:04:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 20 not checked. [2021-11-06 00:04:30,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:04:30,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980054107] [2021-11-06 00:04:30,723 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:04:30,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004372892] [2021-11-06 00:04:30,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004372892] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:04:30,723 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:04:30,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2021-11-06 00:04:30,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876480492] [2021-11-06 00:04:30,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:04:30,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-06 00:04:30,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:04:30,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-06 00:04:30,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=156, Unknown=14, NotChecked=186, Total=420 [2021-11-06 00:04:30,725 INFO L87 Difference]: Start difference. First operand 2953 states and 3411 transitions. Second operand has 21 states, 21 states have (on average 28.095238095238095) internal successors, (590), 20 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:33,151 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (forall ((v_ULTIMATE.start_seq_next_~pos.base_10 Int) (v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_10 Int) (v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_192 Int) (v_DerPreprocessor_4 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_10 Int)) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_192 (store (select |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_192) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_10 v_DerPreprocessor_4)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_10 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_10))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_10 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_10) 1))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_192) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_10)))))) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:04:35,180 WARN L838 $PredicateComparison]: unable to prove that (and (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base |c_#StackHeapBarrier|) (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|) (forall ((v_ULTIMATE.start_seq_next_~pos.base_10 Int) (v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_10 Int) (v_DerPreprocessor_4 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_10 Int)) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base (store (select |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_10 v_DerPreprocessor_4)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_10 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_10))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_10 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_10) 1))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_10))))))) is different from false [2021-11-06 00:04:37,190 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| |c_#StackHeapBarrier|) (forall ((v_ULTIMATE.start_seq_next_~pos.base_10 Int) (v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_10 Int) (v_DerPreprocessor_4 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_10 Int)) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base|) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_10 v_DerPreprocessor_4)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_10 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_10))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_10 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_10) 1))))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ 1 (select .cse1 .cse2)))) (or (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_10) (<= (mod .cse3 4294967296) 15))))))) is different from false [2021-11-06 00:04:39,197 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (forall ((v_ULTIMATE.start_seq_next_~pos.base_10 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_10 Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_10 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_10))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_10 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_10) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_10) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:04:41,297 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< (+ c_ULTIMATE.start_ldv_xmalloc_~res~4.base 1) |c_~#nfnl_log_net_id~0.base|) (forall ((v_ULTIMATE.start_seq_next_~pos.base_10 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_10 Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_10 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_10))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_10 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_10) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base v_ULTIMATE.start_seq_next_~pos.base_10) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0))))))) is different from false [2021-11-06 00:04:43,322 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_seq_next_~pos.base_10 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_10 Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_10 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_10))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_10 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_10) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_10) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< (+ |c_ULTIMATE.start_ldv_xmalloc_#res.base| 1) |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:04:44,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:04:44,640 INFO L93 Difference]: Finished difference Result 4759 states and 5520 transitions. [2021-11-06 00:04:44,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 00:04:44,641 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 28.095238095238095) internal successors, (590), 20 states have internal predecessors, (590), 0 states have call successors, (0), 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 374 [2021-11-06 00:04:44,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:04:44,645 INFO L225 Difference]: With dead ends: 4759 [2021-11-06 00:04:44,645 INFO L226 Difference]: Without dead ends: 3571 [2021-11-06 00:04:44,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 755 GetRequests, 727 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 40508.70ms TimeCoverageRelationStatistics Valid=86, Invalid=214, Unknown=20, NotChecked=492, Total=812 [2021-11-06 00:04:44,648 INFO L933 BasicCegarLoop]: 1530 mSDtfsCounter, 1637 mSDsluCounter, 16956 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 982.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1637 SdHoareTripleChecker+Valid, 18486 SdHoareTripleChecker+Invalid, 6203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.01ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5694 IncrementalHoareTripleChecker+Unchecked, 1168.46ms IncrementalHoareTripleChecker+Time [2021-11-06 00:04:44,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1637 Valid, 18486 Invalid, 6203 Unknown, 0 Unchecked, 15.01ms Time], IncrementalHoareTripleChecker [1 Valid, 508 Invalid, 0 Unknown, 5694 Unchecked, 1168.46ms Time] [2021-11-06 00:04:44,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2021-11-06 00:04:45,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 3046. [2021-11-06 00:04:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3046 states, 3045 states have (on average 1.154351395730706) internal successors, (3515), 3045 states have internal predecessors, (3515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:45,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 3046 states and 3515 transitions. [2021-11-06 00:04:45,102 INFO L78 Accepts]: Start accepts. Automaton has 3046 states and 3515 transitions. Word has length 374 [2021-11-06 00:04:45,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:04:45,103 INFO L470 AbstractCegarLoop]: Abstraction has 3046 states and 3515 transitions. [2021-11-06 00:04:45,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 28.095238095238095) internal successors, (590), 20 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:45,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 3515 transitions. [2021-11-06 00:04:45,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2021-11-06 00:04:45,107 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:04:45,107 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:04:45,142 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 00:04:45,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:04:45,307 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:04:45,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:04:45,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1686261834, now seen corresponding path program 1 times [2021-11-06 00:04:45,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:04:45,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086593836] [2021-11-06 00:04:45,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:04:45,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:04:45,357 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:04:45,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1275998134] [2021-11-06 00:04:45,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:04:45,358 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:04:45,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:04:45,360 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 00:04:45,361 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 00:04:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:04:47,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 3731 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-06 00:04:47,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:04:47,585 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-06 00:04:47,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2021-11-06 00:04:48,048 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-06 00:04:48,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2021-11-06 00:04:48,100 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-06 00:04:48,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 55 [2021-11-06 00:04:49,091 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-06 00:04:49,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2021-11-06 00:04:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 00:04:49,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:05:08,168 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_11 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_11 Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_11 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_11))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_11 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_11) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_11)))))) is different from false [2021-11-06 00:05:10,214 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_11 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_11 Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_11 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_11))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_11 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_11) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base v_ULTIMATE.start_seq_next_~pos.base_11) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) is different from false [2021-11-06 00:05:12,409 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.base_11 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_11 Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_11 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_11))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_11 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_11) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_11) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) is different from false [2021-11-06 00:05:17,297 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_12 Int) (v_ULTIMATE.start_seq_next_~pos.base_11 Int) (v_DerPreprocessor_5 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_11 Int)) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base|) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_12 v_DerPreprocessor_5)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_11 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_11))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_11 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_11) 1))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_11) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) is different from false [2021-11-06 00:05:19,357 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_12 Int) (v_ULTIMATE.start_seq_next_~pos.base_11 Int) (v_DerPreprocessor_5 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_11 Int)) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base (store (select |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_12 v_DerPreprocessor_5)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_11 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_11))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_11 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_11) 1))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_11) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) is different from false [2021-11-06 00:05:21,652 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_12 Int) (v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_206 Int) (v_ULTIMATE.start_seq_next_~pos.base_11 Int) (v_DerPreprocessor_5 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_11 Int)) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_206 (store (select |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_206) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_12 v_DerPreprocessor_5)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_11 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_11))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_11 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_11) 1))))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ 1 (select .cse1 .cse2)))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_11) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_206) (<= (mod .cse3 4294967296) 15)))))) is different from false [2021-11-06 00:05:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 20 not checked. [2021-11-06 00:05:22,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:05:22,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086593836] [2021-11-06 00:05:22,504 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:05:22,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275998134] [2021-11-06 00:05:22,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275998134] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:05:22,504 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:05:22,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2021-11-06 00:05:22,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053573576] [2021-11-06 00:05:22,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:05:22,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-06 00:05:22,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:05:22,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-06 00:05:22,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=156, Unknown=14, NotChecked=186, Total=420 [2021-11-06 00:05:22,506 INFO L87 Difference]: Start difference. First operand 3046 states and 3515 transitions. Second operand has 21 states, 21 states have (on average 28.285714285714285) internal successors, (594), 20 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:05:25,428 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_12 Int) (v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_206 Int) (v_ULTIMATE.start_seq_next_~pos.base_11 Int) (v_DerPreprocessor_5 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_11 Int)) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_206 (store (select |c_#memory_int| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_206) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_12 v_DerPreprocessor_5)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_11 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_11))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_11 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_11) 1))))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ 1 (select .cse1 .cse2)))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_11) (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_ldv_xmalloc_~tmp~99.base_206) (<= (mod .cse3 4294967296) 15)))))) (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:05:27,440 WARN L838 $PredicateComparison]: unable to prove that (and (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base |c_#StackHeapBarrier|) (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (forall ((v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_12 Int) (v_ULTIMATE.start_seq_next_~pos.base_11 Int) (v_DerPreprocessor_5 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_11 Int)) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base (store (select |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_12 v_DerPreprocessor_5)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_11 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_11))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_11 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_11) 1))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_11) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:05:29,449 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_12 Int) (v_ULTIMATE.start_seq_next_~pos.base_11 Int) (v_DerPreprocessor_5 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_11 Int)) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res.base|) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_12 v_DerPreprocessor_5)))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.base_11 (let ((.cse5 (select .cse4 v_ULTIMATE.start_seq_next_~pos.base_11))) (store .cse5 v_ULTIMATE.start_seq_next_~pos.offset_11 (+ (select .cse5 v_ULTIMATE.start_seq_next_~pos.offset_11) 1))))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_11) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| |c_#StackHeapBarrier|)) is different from false [2021-11-06 00:05:31,457 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (forall ((v_ULTIMATE.start_seq_next_~pos.base_11 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_11 Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_11 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_11))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_11 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_11) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_11) (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:05:33,545 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_seq_next_~pos.base_11 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_11 Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_11 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_11))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_11 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_11) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base v_ULTIMATE.start_seq_next_~pos.base_11) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0)))))) (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< (+ c_ULTIMATE.start_ldv_xmalloc_~res~4.base 1) |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-06 00:05:35,569 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|)) (< (+ |c_ULTIMATE.start_ldv_xmalloc_#res.base| 1) |c_~#nfnl_log_net_id~0.base|) (forall ((v_ULTIMATE.start_seq_next_~pos.base_11 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int) (v_ULTIMATE.start_seq_next_~pos.offset_11 Int)) (let ((.cse1 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_11 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_11))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_11 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_11) 1)))))) (let ((.cse2 (select .cse1 ULTIMATE.start_get_next_~st.base)) (.cse3 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse0 (+ (select .cse2 .cse3) 1))) (or (<= (mod .cse0 4294967296) 15) (= (select (select (store .cse1 ULTIMATE.start_get_next_~st.base (store .cse2 .cse3 .cse0)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_11))))))) is different from false [2021-11-06 00:05:36,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:05:36,953 INFO L93 Difference]: Finished difference Result 5008 states and 5802 transitions. [2021-11-06 00:05:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 00:05:36,953 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 28.285714285714285) internal successors, (594), 20 states have internal predecessors, (594), 0 states have call successors, (0), 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 376 [2021-11-06 00:05:36,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:05:36,957 INFO L225 Difference]: With dead ends: 5008 [2021-11-06 00:05:36,958 INFO L226 Difference]: Without dead ends: 3820 [2021-11-06 00:05:36,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 731 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 40578.96ms TimeCoverageRelationStatistics Valid=86, Invalid=214, Unknown=20, NotChecked=492, Total=812 [2021-11-06 00:05:36,959 INFO L933 BasicCegarLoop]: 1526 mSDtfsCounter, 645 mSDsluCounter, 17362 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1382.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 18888 SdHoareTripleChecker+Invalid, 6097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.88ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5614 IncrementalHoareTripleChecker+Unchecked, 1626.89ms IncrementalHoareTripleChecker+Time [2021-11-06 00:05:36,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [645 Valid, 18888 Invalid, 6097 Unknown, 0 Unchecked, 14.88ms Time], IncrementalHoareTripleChecker [1 Valid, 482 Invalid, 0 Unknown, 5614 Unchecked, 1626.89ms Time] [2021-11-06 00:05:36,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2021-11-06 00:05:37,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 2981. [2021-11-06 00:05:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2981 states, 2980 states have (on average 1.1550335570469799) internal successors, (3442), 2980 states have internal predecessors, (3442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:05:37,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2981 states to 2981 states and 3442 transitions. [2021-11-06 00:05:37,469 INFO L78 Accepts]: Start accepts. Automaton has 2981 states and 3442 transitions. Word has length 376 [2021-11-06 00:05:37,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:05:37,469 INFO L470 AbstractCegarLoop]: Abstraction has 2981 states and 3442 transitions. [2021-11-06 00:05:37,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 28.285714285714285) internal successors, (594), 20 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:05:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2981 states and 3442 transitions. [2021-11-06 00:05:37,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2021-11-06 00:05:37,473 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:05:37,473 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:05:37,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-11-06 00:05:37,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:05:37,674 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:05:37,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:05:37,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1569944396, now seen corresponding path program 1 times [2021-11-06 00:05:37,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:05:37,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008263800] [2021-11-06 00:05:37,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:05:37,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:05:37,724 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:05:37,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [539884108] [2021-11-06 00:05:37,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:05:37,724 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:05:37,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:05:37,726 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 00:05:37,727 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 00:05:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:05:39,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 3730 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-06 00:05:39,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:05:40,111 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-06 00:05:40,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2021-11-06 00:05:40,601 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-06 00:05:40,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2021-11-06 00:05:40,653 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-06 00:05:40,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 55 [2021-11-06 00:05:41,622 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-06 00:05:41,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2021-11-06 00:05:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 00:05:41,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:00,679 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_12 Int) (v_ULTIMATE.start_seq_next_~pos.base_12 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_12 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_12))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_12 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_12) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ 1 (select .cse1 .cse2)))) (or (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_12) (<= (mod .cse3 4294967296) 15)))))) is different from false [2021-11-06 00:06:02,717 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_12 Int) (v_ULTIMATE.start_seq_next_~pos.base_12 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_12 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_12))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_12 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_12) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ 1 (select .cse1 .cse2)))) (or (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= (mod .cse3 4294967296) 15) (< c_ULTIMATE.start_ldv_xmalloc_~res~4.base v_ULTIMATE.start_seq_next_~pos.base_12)))))) is different from false [2021-11-06 00:06:04,900 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_12 Int) (v_ULTIMATE.start_seq_next_~pos.base_12 Int) (ULTIMATE.start_get_next_~st.base Int) (ULTIMATE.start_get_next_~st.offset Int)) (let ((.cse0 (store |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_12 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_12))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_12 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_12) 1)))))) (let ((.cse1 (select .cse0 ULTIMATE.start_get_next_~st.base)) (.cse2 (+ ULTIMATE.start_get_next_~st.offset 8))) (let ((.cse3 (+ 1 (select .cse1 .cse2)))) (or (= (select (select (store .cse0 ULTIMATE.start_get_next_~st.base (store .cse1 .cse2 .cse3)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) 0) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_12) (<= (mod .cse3 4294967296) 15)))))) is different from false [2021-11-06 00:06:09,620 WARN L228 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-11-06 00:06:09,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:06:09,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008263800] [2021-11-06 00:06:09,621 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:06:09,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539884108] [2021-11-06 00:06:09,621 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2021-11-06 00:06:09,621 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:09,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-06 00:06:09,621 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-06 00:06:09,621 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-06 00:06:09,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2021-11-06 00:06:09,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (111 of 112 remaining) [2021-11-06 00:06:09,637 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (110 of 112 remaining) [2021-11-06 00:06:09,638 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (109 of 112 remaining) [2021-11-06 00:06:09,638 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (108 of 112 remaining) [2021-11-06 00:06:09,638 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (107 of 112 remaining) [2021-11-06 00:06:09,638 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (106 of 112 remaining) [2021-11-06 00:06:09,638 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (105 of 112 remaining) [2021-11-06 00:06:09,639 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (104 of 112 remaining) [2021-11-06 00:06:09,639 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (103 of 112 remaining) [2021-11-06 00:06:09,639 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (102 of 112 remaining) [2021-11-06 00:06:09,639 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (101 of 112 remaining) [2021-11-06 00:06:09,639 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (100 of 112 remaining) [2021-11-06 00:06:09,639 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (99 of 112 remaining) [2021-11-06 00:06:09,639 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (98 of 112 remaining) [2021-11-06 00:06:09,639 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (97 of 112 remaining) [2021-11-06 00:06:09,639 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (96 of 112 remaining) [2021-11-06 00:06:09,639 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (95 of 112 remaining) [2021-11-06 00:06:09,639 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (94 of 112 remaining) [2021-11-06 00:06:09,640 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (93 of 112 remaining) [2021-11-06 00:06:09,640 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (92 of 112 remaining) [2021-11-06 00:06:09,640 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (91 of 112 remaining) [2021-11-06 00:06:09,640 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (90 of 112 remaining) [2021-11-06 00:06:09,640 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (89 of 112 remaining) [2021-11-06 00:06:09,640 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (88 of 112 remaining) [2021-11-06 00:06:09,640 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (87 of 112 remaining) [2021-11-06 00:06:09,640 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (86 of 112 remaining) [2021-11-06 00:06:09,640 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (85 of 112 remaining) [2021-11-06 00:06:09,640 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (84 of 112 remaining) [2021-11-06 00:06:09,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (83 of 112 remaining) [2021-11-06 00:06:09,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (82 of 112 remaining) [2021-11-06 00:06:09,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (81 of 112 remaining) [2021-11-06 00:06:09,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION (80 of 112 remaining) [2021-11-06 00:06:09,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION (79 of 112 remaining) [2021-11-06 00:06:09,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION (78 of 112 remaining) [2021-11-06 00:06:09,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION (77 of 112 remaining) [2021-11-06 00:06:09,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION (76 of 112 remaining) [2021-11-06 00:06:09,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION (75 of 112 remaining) [2021-11-06 00:06:09,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION (74 of 112 remaining) [2021-11-06 00:06:09,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION (73 of 112 remaining) [2021-11-06 00:06:09,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION (72 of 112 remaining) [2021-11-06 00:06:09,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION (71 of 112 remaining) [2021-11-06 00:06:09,642 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION (70 of 112 remaining) [2021-11-06 00:06:09,642 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION (69 of 112 remaining) [2021-11-06 00:06:09,642 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION (68 of 112 remaining) [2021-11-06 00:06:09,642 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION (67 of 112 remaining) [2021-11-06 00:06:09,642 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION (66 of 112 remaining) [2021-11-06 00:06:09,642 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION (65 of 112 remaining) [2021-11-06 00:06:09,642 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION (64 of 112 remaining) [2021-11-06 00:06:09,642 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION (63 of 112 remaining) [2021-11-06 00:06:09,642 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION (62 of 112 remaining) [2021-11-06 00:06:09,642 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION (61 of 112 remaining) [2021-11-06 00:06:09,642 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION (60 of 112 remaining) [2021-11-06 00:06:09,642 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (59 of 112 remaining) [2021-11-06 00:06:09,642 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION (58 of 112 remaining) [2021-11-06 00:06:09,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION (57 of 112 remaining) [2021-11-06 00:06:09,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONERROR_FUNCTION (56 of 112 remaining) [2021-11-06 00:06:09,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONERROR_FUNCTION (55 of 112 remaining) [2021-11-06 00:06:09,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONERROR_FUNCTION (54 of 112 remaining) [2021-11-06 00:06:09,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONERROR_FUNCTION (53 of 112 remaining) [2021-11-06 00:06:09,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONERROR_FUNCTION (52 of 112 remaining) [2021-11-06 00:06:09,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONERROR_FUNCTION (51 of 112 remaining) [2021-11-06 00:06:09,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION (50 of 112 remaining) [2021-11-06 00:06:09,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONERROR_FUNCTION (49 of 112 remaining) [2021-11-06 00:06:09,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONERROR_FUNCTION (48 of 112 remaining) [2021-11-06 00:06:09,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONERROR_FUNCTION (47 of 112 remaining) [2021-11-06 00:06:09,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONERROR_FUNCTION (46 of 112 remaining) [2021-11-06 00:06:09,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONERROR_FUNCTION (45 of 112 remaining) [2021-11-06 00:06:09,644 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION (44 of 112 remaining) [2021-11-06 00:06:09,644 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION (43 of 112 remaining) [2021-11-06 00:06:09,644 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION (42 of 112 remaining) [2021-11-06 00:06:09,644 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION (41 of 112 remaining) [2021-11-06 00:06:09,644 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONERROR_FUNCTION (40 of 112 remaining) [2021-11-06 00:06:09,644 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONERROR_FUNCTION (39 of 112 remaining) [2021-11-06 00:06:09,644 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION (38 of 112 remaining) [2021-11-06 00:06:09,644 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION (37 of 112 remaining) [2021-11-06 00:06:09,644 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONERROR_FUNCTION (36 of 112 remaining) [2021-11-06 00:06:09,644 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION (35 of 112 remaining) [2021-11-06 00:06:09,644 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION (34 of 112 remaining) [2021-11-06 00:06:09,644 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONERROR_FUNCTION (33 of 112 remaining) [2021-11-06 00:06:09,644 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION (32 of 112 remaining) [2021-11-06 00:06:09,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONERROR_FUNCTION (31 of 112 remaining) [2021-11-06 00:06:09,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONERROR_FUNCTION (30 of 112 remaining) [2021-11-06 00:06:09,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION (29 of 112 remaining) [2021-11-06 00:06:09,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION (28 of 112 remaining) [2021-11-06 00:06:09,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION (27 of 112 remaining) [2021-11-06 00:06:09,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONERROR_FUNCTION (26 of 112 remaining) [2021-11-06 00:06:09,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONERROR_FUNCTION (25 of 112 remaining) [2021-11-06 00:06:09,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONERROR_FUNCTION (24 of 112 remaining) [2021-11-06 00:06:09,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONERROR_FUNCTION (23 of 112 remaining) [2021-11-06 00:06:09,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONERROR_FUNCTION (22 of 112 remaining) [2021-11-06 00:06:09,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONERROR_FUNCTION (21 of 112 remaining) [2021-11-06 00:06:09,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONERROR_FUNCTION (20 of 112 remaining) [2021-11-06 00:06:09,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONERROR_FUNCTION (19 of 112 remaining) [2021-11-06 00:06:09,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONERROR_FUNCTION (18 of 112 remaining) [2021-11-06 00:06:09,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONERROR_FUNCTION (17 of 112 remaining) [2021-11-06 00:06:09,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONERROR_FUNCTION (16 of 112 remaining) [2021-11-06 00:06:09,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONERROR_FUNCTION (15 of 112 remaining) [2021-11-06 00:06:09,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONERROR_FUNCTION (14 of 112 remaining) [2021-11-06 00:06:09,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONERROR_FUNCTION (13 of 112 remaining) [2021-11-06 00:06:09,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONERROR_FUNCTION (12 of 112 remaining) [2021-11-06 00:06:09,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION (11 of 112 remaining) [2021-11-06 00:06:09,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION (10 of 112 remaining) [2021-11-06 00:06:09,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION (9 of 112 remaining) [2021-11-06 00:06:09,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONERROR_FUNCTION (8 of 112 remaining) [2021-11-06 00:06:09,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONERROR_FUNCTION (7 of 112 remaining) [2021-11-06 00:06:09,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONERROR_FUNCTION (6 of 112 remaining) [2021-11-06 00:06:09,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONERROR_FUNCTION (5 of 112 remaining) [2021-11-06 00:06:09,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONERROR_FUNCTION (4 of 112 remaining) [2021-11-06 00:06:09,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONERROR_FUNCTION (3 of 112 remaining) [2021-11-06 00:06:09,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONERROR_FUNCTION (2 of 112 remaining) [2021-11-06 00:06:09,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONERROR_FUNCTION (1 of 112 remaining) [2021-11-06 00:06:09,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONERROR_FUNCTION (0 of 112 remaining) [2021-11-06 00:06:09,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-06 00:06:09,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:06:09,851 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:06:09,853 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 00:06:09,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 12:06:09 BoogieIcfgContainer [2021-11-06 00:06:09,923 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 00:06:09,924 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 00:06:09,924 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 00:06:09,924 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 00:06:09,925 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:58:20" (3/4) ... [2021-11-06 00:06:09,927 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-06 00:06:09,927 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 00:06:09,928 INFO L158 Benchmark]: Toolchain (without parser) took 477170.01ms. Allocated memory was 54.5MB in the beginning and 1.8GB in the end (delta: 1.8GB). Free memory was 26.4MB in the beginning and 659.8MB in the end (delta: -633.4MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2021-11-06 00:06:09,928 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 54.5MB. Free memory is still 36.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-06 00:06:09,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 4108.09ms. Allocated memory was 54.5MB in the beginning and 165.7MB in the end (delta: 111.1MB). Free memory was 26.2MB in the beginning and 91.2MB in the end (delta: -65.0MB). Peak memory consumption was 78.0MB. Max. memory is 16.1GB. [2021-11-06 00:06:09,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 290.58ms. Allocated memory is still 165.7MB. Free memory was 91.2MB in the beginning and 84.8MB in the end (delta: 6.4MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2021-11-06 00:06:09,929 INFO L158 Benchmark]: Boogie Preprocessor took 201.90ms. Allocated memory is still 165.7MB. Free memory was 84.8MB in the beginning and 59.0MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-11-06 00:06:09,929 INFO L158 Benchmark]: RCFGBuilder took 2966.17ms. Allocated memory was 165.7MB in the beginning and 278.9MB in the end (delta: 113.2MB). Free memory was 59.0MB in the beginning and 114.6MB in the end (delta: -55.7MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. [2021-11-06 00:06:09,929 INFO L158 Benchmark]: TraceAbstraction took 469592.96ms. Allocated memory was 278.9MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 114.6MB in the beginning and 659.8MB in the end (delta: -545.1MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2021-11-06 00:06:09,929 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 1.8GB. Free memory is still 659.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-06 00:06:09,936 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 54.5MB. Free memory is still 36.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 4108.09ms. Allocated memory was 54.5MB in the beginning and 165.7MB in the end (delta: 111.1MB). Free memory was 26.2MB in the beginning and 91.2MB in the end (delta: -65.0MB). Peak memory consumption was 78.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 290.58ms. Allocated memory is still 165.7MB. Free memory was 91.2MB in the beginning and 84.8MB in the end (delta: 6.4MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 201.90ms. Allocated memory is still 165.7MB. Free memory was 84.8MB in the beginning and 59.0MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2966.17ms. Allocated memory was 165.7MB in the beginning and 278.9MB in the end (delta: 113.2MB). Free memory was 59.0MB in the beginning and 114.6MB in the end (delta: -55.7MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. * TraceAbstraction took 469592.96ms. Allocated memory was 278.9MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 114.6MB in the beginning and 659.8MB in the end (delta: -545.1MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 1.8GB. Free memory is still 659.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 14766]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint, overapproximation of large string literal at line 8827, overapproximation of bitwiseOr at line 6976, overapproximation of bitwiseAnd at line 7628. Possible FailurePath: [L7614] static int nfnl_log_net_id ; [L8527] static struct nf_loginfo default_loginfo = {1U, {{65535U, 0U, 1U}}}; [L8737-L8742] static char const __kstrtab_nfulnl_log_packet[18U] = { 'n', 'f', 'u', 'l', 'n', 'l', '_', 'l', 'o', 'g', '_', 'p', 'a', 'c', 'k', 'e', 't', '\000'}; [L8744] struct kernel_symbol const __ksymtab_nfulnl_log_packet = {(unsigned long )(& nfulnl_log_packet), (char const *)(& __kstrtab_nfulnl_log_packet)}; [L8819] static struct notifier_block nfulnl_rtnl_notifier = {& nfulnl_rcv_nl_event, 0, 0}; [L8827] static struct nf_logger nfulnl_logger = {(char *)"nfnetlink_log", 1, & nfulnl_log_packet, & __this_module}; [L8828-L8834] static struct nla_policy const nfula_cfg_policy[7U] = { {(unsigned short)0, (unsigned short)0}, {(unsigned short)0, 1U}, {(unsigned short)0, 6U}, {3U, (unsigned short)0}, {3U, (unsigned short)0}, {3U, (unsigned short)0}, {2U, (unsigned short)0}}; [L9059-L9061] static struct nfnl_callback const nfulnl_cb[2U] = { {& nfulnl_recv_unsupp, 0, 0, 0, 17U}, {& nfulnl_recv_config, 0, 0, (struct nla_policy const *)(& nfula_cfg_policy), 6U}}; [L9062] static struct nfnetlink_subsystem const nfulnl_subsys = {"log", 4U, 2U, (struct nfnl_callback const *)(& nfulnl_cb), 0, 0}; [L9275] static struct seq_operations const nful_seq_ops = {& seq_start, & seq_stop, & seq_next, & seq_show}; [L9286-L9288] static struct file_operations const nful_file_ops = {& __this_module, & seq_lseek, & seq_read, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, & nful_open, 0, & seq_release_net, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L9334] static struct pernet_operations nfnl_log_net_ops = {{0, 0}, & nfnl_log_net_init, & nfnl_log_net_exit, 0, & nfnl_log_net_id, 208UL}; [L9468] struct ldv_thread ldv_thread_0 ; [L9469] struct ldv_thread ldv_thread_1 ; [L9470] struct ldv_thread ldv_thread_11 ; [L9471] struct ldv_thread ldv_thread_2 ; [L9472] struct ldv_thread ldv_thread_3 ; [L9473] struct ldv_thread ldv_thread_4 ; [L9474] struct ldv_thread ldv_thread_5 ; [L9475] struct ldv_thread ldv_thread_6 ; [L9476] struct ldv_thread ldv_thread_7 ; [L10752] int ldv_linux_alloc_usb_lock_lock = 1; [L10910] int ldv_linux_arch_io_iomem = 0; [L10952] static int ldv_linux_block_genhd_disk_state = 0; [L10998] static int ldv_linux_block_queue_queue_state = 0; [L11022] int ldv_linux_block_request_blk_rq = 0; [L11046] int ldv_linux_drivers_base_class_usb_gadget_class = 0; [L11207] int ldv_linux_fs_char_dev_usb_gadget_chrdev = 0; [L11270] int ldv_linux_fs_sysfs_sysfs = 0; [L11313] int ldv_linux_kernel_locking_rwlock_rlock = 1; [L11314] int ldv_linux_kernel_locking_rwlock_wlock = 1; [L11405] int ldv_linux_kernel_module_module_refcounter = 1; [L11476] int ldv_linux_kernel_rcu_srcu_srcu_nested = 0; [L11515] int ldv_linux_kernel_rcu_update_lock_bh_rcu_nested_bh = 0; [L11554] int ldv_linux_kernel_rcu_update_lock_sched_rcu_nested_sched = 0; [L11593] int ldv_linux_kernel_rcu_update_lock_rcu_nested = 0; [L11669] static bool __ldv_in_interrupt_context = 0; [L11748] unsigned short ldv_linux_mmc_sdio_func_sdio_element = 0U; [L11789] int ldv_linux_net_register_probe_state = 0; [L11832] int rtnllocknumber = 0; [L11908] int locksocknumber = 0; [L11962] int ldv_linux_usb_coherent_coherent_state = 0; [L12006] ldv_map LDV_LINUX_USB_DEV_USB_DEV_REF_COUNTS ; [L12070] int ldv_linux_usb_gadget_usb_gadget = 0; [L12220] int ldv_linux_usb_register_probe_state = 0; [L12262] int ldv_linux_usb_urb_urb_state = 0; [L12532] ldv_set LDV_LINUX_KERNEL_LOCKING_MUTEX_MUTEXES_i_mutex_of_inode ; [L12618] ldv_set LDV_LINUX_KERNEL_LOCKING_MUTEX_MUTEXES_lock ; [L12704] ldv_set LDV_LINUX_KERNEL_LOCKING_MUTEX_MUTEXES_mutex_of_device ; [L12814] static int ldv_linux_kernel_locking_spinlock_spin__xmit_lock_of_netdev_queue = 1; [L12919] static int ldv_linux_kernel_locking_spinlock_spin_addr_list_lock_of_net_device = 1; [L13024] static int ldv_linux_kernel_locking_spinlock_spin_alloc_lock_of_task_struct = 1; [L13129] static int ldv_linux_kernel_locking_spinlock_spin_i_lock_of_inode = 1; [L13234] static int ldv_linux_kernel_locking_spinlock_spin_instances_lock_of_nfnl_log_net = 1; [L13339] static int ldv_linux_kernel_locking_spinlock_spin_lock = 1; [L13444] static int ldv_linux_kernel_locking_spinlock_spin_lock_of_NOT_ARG_SIGN = 1; [L13549] static int ldv_linux_kernel_locking_spinlock_spin_lock_of_nfulnl_instance = 1; [L13654] static int ldv_linux_kernel_locking_spinlock_spin_node_size_lock_of_pglist_data = 1; [L13759] static int ldv_linux_kernel_locking_spinlock_spin_poll_lock_of_napi_struct = 1; [L13864] static int ldv_linux_kernel_locking_spinlock_spin_ptl = 1; [L13969] static int ldv_linux_kernel_locking_spinlock_spin_siglock_of_sighand_struct = 1; [L14074] static int ldv_linux_kernel_locking_spinlock_spin_slock_of_NOT_ARG_SIGN = 1; [L14179] static int ldv_linux_kernel_locking_spinlock_spin_tx_global_lock_of_net_device = 1; [L14370] static int ldv_linux_kernel_sched_completion_completion = 0; [L14402] static int ldv_linux_lib_idr_idr = 0; [L12290] COND FALSE !(expression == 0) [L9706] void (*ldv_11_exit_nfnetlink_log_fini_default)(void) ; [L9707] int (*ldv_11_init_nfnetlink_log_init_default)(void) ; [L9708] int ldv_11_ret_default ; [L9709] int tmp ; [L9710] int tmp___0 ; [L9488] int tmp ; [L9337] int status ; [L9340] status = -12 [L10564] ldv_func_ret_type___2 ldv_func_res ; [L10565] int tmp ; [L10566] int tmp___0 ; [L15624] return __VERIFIER_nondet_int(); [L10569] tmp = netlink_register_notifier(ldv_func_arg1) [L10570] ldv_func_res = tmp [L9975] struct notifier_block *ldv_10_struct_notifier_block_struct_notifier_block ; [L9976] int tmp ; [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L9979] tmp = ldv_undef_int() [L9981] COND TRUE tmp != 0 [L12290] COND FALSE !(expression == 0) [L9984] ldv_10_struct_notifier_block_struct_notifier_block = arg1 [L9566] struct ldv_struct_dummy_resourceless_instance_4 *cf_arg_4 ; [L9567] void *tmp ; [L12395] void *res ; [L12396] void *tmp ; [L12397] long tmp___0 ; [L12400] tmp = malloc(size) [L12401] res = tmp [L12290] COND FALSE !(expression == 0) [L11169] return ((unsigned long )ptr > 4294967295UL); [L12403] tmp___0 = ldv_is_err((void const *)res) [L12290] COND FALSE !(expression == 0) [L12406] return (res); [L9570] tmp = ldv_xmalloc(16UL) [L9571] cf_arg_4 = (struct ldv_struct_dummy_resourceless_instance_4 *)tmp [L9572] cf_arg_4->arg0 = arg0 [L10212] int (*ldv_4_callback_notifier_call)(struct notifier_block * , unsigned long , void * ) ; [L10213] struct notifier_block *ldv_4_container_struct_notifier_block ; [L10214] unsigned long ldv_4_ldv_param_3_1_default ; [L10215] void *ldv_4_ldv_param_3_2_default ; [L10216] struct ldv_struct_dummy_resourceless_instance_4 *data ; [L10217] int tmp ; [L10219] data = (struct ldv_struct_dummy_resourceless_instance_4 *)arg0 [L10220] COND TRUE (unsigned long )data != (unsigned long )((struct ldv_struct_dummy_resourceless_instance_4 *)0) [L10222] EXPR data->arg0 [L10222] ldv_4_container_struct_notifier_block = data->arg0 [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L10231] tmp = ldv_undef_int() [L10233] COND FALSE !(tmp != 0) [L9987] return (arg0); [L10571] tmp___0 = ldv_netlink_register_notifier(ldv_func_res, ldv_func_arg1) [L10573] return (tmp___0); [L15652] return __VERIFIER_nondet_int(); [L9342] status = nfnetlink_subsys_register(& nfulnl_subsys) [L9344] COND FALSE !(status < 0) [L15636] return __VERIFIER_nondet_int(); [L9352] status = nf_log_register(0, & nfulnl_logger) [L9354] COND FALSE !(status < 0) [L15686] return __VERIFIER_nondet_int(); [L9362] status = register_pernet_subsys(& nfnl_log_net_ops) [L9364] COND FALSE !(status < 0) [L9371] return (status); [L9491] tmp = nfnetlink_log_init() [L9493] return (tmp); [L9713] ldv_11_ret_default = ldv_EMGentry_init_nfnetlink_log_init_11_17(ldv_11_init_nfnetlink_log_init_default) [L10609] int tmp ; [L11810] ldv_linux_net_register_probe_state = 0 [L12241] ldv_linux_usb_register_probe_state = 0 [L11641] int tmp ; [L12290] COND FALSE !(expression == 0) [L11636] return (val); [L11644] tmp = ldv_filter_positive_int(init_ret_val) [L11646] return (tmp); [L10614] tmp = ldv_post_init(ldv_func_arg1) [L10616] return (tmp); [L9714] ldv_11_ret_default = ldv_ldv_post_init_158(ldv_11_ret_default) [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L9715] tmp___0 = ldv_undef_int() [L9717] COND FALSE !(tmp___0 != 0) [L12290] COND FALSE !(expression == 0) [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L9727] tmp = ldv_undef_int() [L9729] COND TRUE tmp != 0 [L9637] struct ldv_struct_EMGentry_11 *cf_arg_1 ; [L9638] void *tmp ; [L12395] void *res ; [L12396] void *tmp ; [L12397] long tmp___0 ; [L12400] tmp = malloc(size) [L12401] res = tmp [L12290] COND FALSE !(expression == 0) [L11169] return ((unsigned long )ptr > 4294967295UL); [L12403] tmp___0 = ldv_is_err((void const *)res) [L12290] COND FALSE !(expression == 0) [L12406] return (res); [L9641] tmp = ldv_xmalloc(4UL) [L9642] cf_arg_1 = (struct ldv_struct_EMGentry_11 *)tmp [L10051] void *ldv_1_ldv_param_10_1_default ; [L10052] long long *ldv_1_ldv_param_4_1_default ; [L10053] void *ldv_1_ldv_param_7_1_default ; [L10054] long long *ldv_1_ldv_param_7_2_default ; [L10055] void *ldv_1_ldv_param_8_1_default ; [L10056] struct seq_operations *ldv_1_ops_seq_operations ; [L10057] struct seq_file *ldv_1_seq_file_seq_file ; [L10058] int ldv_1_started_default ; [L10059] int tmp ; [L10060] void *tmp___0 ; [L10061] void *tmp___1 ; [L10062] int tmp___2 ; [L10063] int tmp___3 ; [L10065] ldv_1_started_default = 0 [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L10070] tmp___3 = ldv_undef_int() [L10072] COND FALSE !(tmp___3 != 0) [L12290] COND FALSE !(expression == 0) [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L10131] tmp___2 = ldv_undef_int() [L10133] COND TRUE tmp___2 != 0 [L12395] void *res ; [L12396] void *tmp ; [L12397] long tmp___0 ; [L12400] tmp = malloc(size) [L12401] res = tmp [L12290] COND FALSE !(expression == 0) [L11169] return ((unsigned long )ptr > 4294967295UL); [L12403] tmp___0 = ldv_is_err((void const *)res) [L12290] COND FALSE !(expression == 0) [L12406] return (res); [L10135] tmp___1 = ldv_xmalloc(8UL) [L10136] ldv_1_ldv_param_4_1_default = (long long *)tmp___1 [L10137] ldv_1_ops_seq_operations->start [L9226] struct net *tmp ; [L9227] struct hlist_node *tmp___0 ; [L11519] ldv_linux_kernel_rcu_update_lock_bh_rcu_nested_bh = ldv_linux_kernel_rcu_update_lock_bh_rcu_nested_bh + 1 [L7311] EXPR seq->private [L7311] EXPR ((struct seq_net_private *)seq->private)->net [L7311] return (((struct seq_net_private *)seq->private)->net); [L9231] tmp = seq_file_net(s) [L9232] EXPR s->private [L9232] EXPR \read(*pos) [L9197] struct hlist_node *head ; [L9065] struct nfnl_log_net *log ; [L9066] struct hlist_head *head ; [L9067] struct hlist_node *________p1 ; [L9068] struct hlist_node *_________p1 ; [L9069] struct hlist_node *__var ; [L9070] bool __warned ; [L9071] int tmp ; [L9072] int tmp___0 ; [L9073] int tmp___1 ; [L9075] COND TRUE (unsigned long )st == (unsigned long )((struct iter_state *)0) [L9076] return ((struct hlist_node *)0); [L9200] head = get_first(net, st) [L9202] COND FALSE !((unsigned long )head != (unsigned long )((struct hlist_node *)0)) [L9221] EXPR pos == 0LL ? head : (struct hlist_node *)0 [L9221] return (pos == 0LL ? head : (struct hlist_node *)0); [L9232] tmp___0 = get_idx(tmp, (struct iter_state *)s->private, *pos) [L9234] return ((void *)tmp___0); [L10140] ldv_1_started_default = 1 [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L10070] tmp___3 = ldv_undef_int() [L10072] COND TRUE tmp___3 != 0 [L12290] COND FALSE !(expression == 0) [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L10075] tmp = ldv_undef_int() [L10078] COND FALSE !(tmp == 1) [L10082] COND FALSE !(tmp == 2) [L10086] COND TRUE tmp == 3 [L12395] void *res ; [L12396] void *tmp ; [L12397] long tmp___0 ; [L12400] tmp = malloc(size) [L12401] res = tmp [L12290] COND FALSE !(expression == 0) [L11169] return ((unsigned long )ptr > 4294967295UL); [L12403] tmp___0 = ldv_is_err((void const *)res) [L12290] COND FALSE !(expression == 0) [L12406] return (res); [L10111] ldv_1_ldv_param_7_1_default = ldv_xmalloc(1UL) [L12395] void *res ; [L12396] void *tmp ; [L12397] long tmp___0 ; [L12400] tmp = malloc(size) [L12401] res = tmp [L12290] COND FALSE !(expression == 0) [L11169] return ((unsigned long )ptr > 4294967295UL); [L12403] tmp___0 = ldv_is_err((void const *)res) [L12290] COND FALSE !(expression == 0) [L12406] return (res); [L10112] tmp___0 = ldv_xmalloc(8UL) [L10113] ldv_1_ldv_param_7_2_default = (long long *)tmp___0 [L10114] ldv_1_ops_seq_operations->next [L9239] struct net *tmp ; [L9240] struct hlist_node *tmp___0 ; [L9243] EXPR \read(*pos) [L9243] *pos = *pos + 1LL [L7311] EXPR seq->private [L7311] EXPR ((struct seq_net_private *)seq->private)->net [L7311] return (((struct seq_net_private *)seq->private)->net); [L9244] tmp = seq_file_net(s) [L9245] EXPR s->private [L9123] struct hlist_node *________p1 ; [L9124] struct hlist_node *_________p1 ; [L9125] struct hlist_node *__var ; [L9126] bool __warned ; [L9127] int tmp ; [L9128] int tmp___0 ; [L9129] struct nfnl_log_net *log ; [L9130] struct hlist_head *head ; [L9131] struct hlist_node *________p1___0 ; [L9132] struct hlist_node *_________p1___0 ; [L9133] struct hlist_node *__var___0 ; [L9134] bool __warned___0 ; [L9135] int tmp___1 ; [L9136] int tmp___2 ; [L9139] __var = (struct hlist_node *)0 [L9140] EXPR h->next [L9140] _________p1 = *((struct hlist_node * volatile *)(& h->next)) [L9141] ________p1 = _________p1 [L15589] return __VERIFIER_nondet_int(); [L9142] tmp = debug_lockdep_rcu_enabled() [L9144] COND FALSE !(tmp != 0 && ! __warned) [L9157] h = ________p1 [L9188] COND TRUE (unsigned long )h == (unsigned long )((struct hlist_node *)0) [L9160] EXPR st->bucket [L9160] st->bucket = st->bucket + 1U [L9161] EXPR st->bucket [L9161] COND TRUE st->bucket > 15U [L9162] return ((struct hlist_node *)0); [L9245] tmp___0 = get_next(tmp, (struct iter_state *)s->private, (struct hlist_node *)v) [L9247] return ((void *)tmp___0); [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L10070] tmp___3 = ldv_undef_int() [L10072] COND TRUE tmp___3 != 0 [L12290] COND FALSE !(expression == 0) [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L10075] tmp = ldv_undef_int() [L10078] COND TRUE tmp == 1 [L12395] void *res ; [L12396] void *tmp ; [L12397] long tmp___0 ; [L12400] tmp = malloc(size) [L12401] res = tmp [L12290] COND FALSE !(expression == 0) [L11169] return ((unsigned long )ptr > 4294967295UL); [L12403] tmp___0 = ldv_is_err((void const *)res) [L12290] COND FALSE !(expression == 0) [L12406] return (res); [L10093] ldv_1_ldv_param_10_1_default = ldv_xmalloc(1UL) [L10094] ldv_1_ops_seq_operations->stop [L14951] COND FALSE !(! expr) [L11528] ldv_linux_kernel_rcu_update_lock_bh_rcu_nested_bh = ldv_linux_kernel_rcu_update_lock_bh_rcu_nested_bh - 1 [L10097] ldv_1_started_default = 0 [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L10070] tmp___3 = ldv_undef_int() [L10072] COND FALSE !(tmp___3 != 0) [L12290] COND FALSE !(expression == 0) [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L10131] tmp___2 = ldv_undef_int() [L10133] COND FALSE !(tmp___2 != 0) [L9624] struct ldv_struct_EMGentry_11 *cf_arg_0 ; [L9625] void *tmp ; [L12395] void *res ; [L12396] void *tmp ; [L12397] long tmp___0 ; [L12400] tmp = malloc(size) [L12401] res = tmp [L12290] COND FALSE !(expression == 0) [L11169] return ((unsigned long )ptr > 4294967295UL); [L12403] tmp___0 = ldv_is_err((void const *)res) [L12290] COND FALSE !(expression == 0) [L12406] return (res); [L9628] tmp = ldv_xmalloc(4UL) [L9629] cf_arg_0 = (struct ldv_struct_EMGentry_11 *)tmp [L9766] long long (*ldv_0_callback_llseek)(struct file * , long long , int ) ; [L9767] long (*ldv_0_callback_read)(struct file * , char * , unsigned long , long long * ) ; [L9768] struct file_operations *ldv_0_container_file_operations ; [L9769] char *ldv_0_ldv_param_22_1_default ; [L9770] long long *ldv_0_ldv_param_22_3_default ; [L9771] char *ldv_0_ldv_param_4_1_default ; [L9772] long long *ldv_0_ldv_param_4_3_default ; [L9773] long long ldv_0_ldv_param_5_1_default ; [L9774] int ldv_0_ldv_param_5_2_default ; [L9775] struct file *ldv_0_resource_file ; [L9776] struct inode *ldv_0_resource_inode ; [L9777] int ldv_0_ret_default ; [L9778] unsigned long ldv_0_size_cnt_write_size ; [L9779] void *tmp ; [L9780] void *tmp___0 ; [L9781] int tmp___1 ; [L9782] int tmp___2 ; [L9783] int tmp___3 ; [L9784] int tmp___4 ; [L9785] void *tmp___5 ; [L9786] void *tmp___6 ; [L9787] void *tmp___7 ; [L9788] void *tmp___8 ; [L9789] int tmp___9 ; [L9792] ldv_0_ret_default = 1 [L12395] void *res ; [L12396] void *tmp ; [L12397] long tmp___0 ; [L12400] tmp = malloc(size) [L12401] res = tmp [L12290] COND FALSE !(expression == 0) [L11169] return ((unsigned long )ptr > 4294967295UL); [L12403] tmp___0 = ldv_is_err((void const *)res) [L12290] COND FALSE !(expression == 0) [L12406] return (res); [L9793] tmp = ldv_xmalloc(504UL) [L9794] ldv_0_resource_file = (struct file *)tmp [L12395] void *res ; [L12396] void *tmp ; [L12397] long tmp___0 ; [L12400] tmp = malloc(size) [L12401] res = tmp [L12290] COND FALSE !(expression == 0) [L11169] return ((unsigned long )ptr > 4294967295UL); [L12403] tmp___0 = ldv_is_err((void const *)res) [L12290] COND FALSE !(expression == 0) [L12406] return (res); [L9795] tmp___0 = ldv_xmalloc(976UL) [L9796] ldv_0_resource_inode = (struct inode *)tmp___0 [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L9797] tmp___1 = ldv_undef_int() [L9798] ldv_0_size_cnt_write_size = (unsigned long )tmp___1 [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L9804] tmp___3 = ldv_undef_int() [L9806] COND FALSE !(tmp___3 != 0) [L9611] struct ldv_struct_EMGentry_11 *cf_arg_5 ; [L9612] void *tmp ; [L12395] void *res ; [L12396] void *tmp ; [L12397] long tmp___0 ; [L12400] tmp = malloc(size) [L12401] res = tmp [L12290] COND FALSE !(expression == 0) [L11169] return ((unsigned long )ptr > 4294967295UL); [L12403] tmp___0 = ldv_is_err((void const *)res) [L12290] COND FALSE !(expression == 0) [L12406] return (res); [L9615] tmp = ldv_xmalloc(4UL) [L9616] cf_arg_5 = (struct ldv_struct_EMGentry_11 *)tmp [L10249] void (*ldv_5_callback_exit)(struct net * ) ; [L10250] int (*ldv_5_callback_init)(struct net * ) ; [L10251] struct net *ldv_5_container_struct_net_ptr ; [L10252] int tmp ; [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L10258] tmp = ldv_undef_int() [L10261] COND FALSE !(tmp == 1) [L10265] COND FALSE !(tmp == 2) [L10269] COND TRUE tmp == 3 [L9593] struct ldv_struct_EMGentry_11 *cf_arg_2 ; [L9594] struct ldv_struct_EMGentry_11 *cf_arg_3 ; [L9595] void *tmp ; [L9596] void *tmp___0 ; [L12395] void *res ; [L12396] void *tmp ; [L12397] long tmp___0 ; [L12400] tmp = malloc(size) [L12401] res = tmp [L12290] COND FALSE !(expression == 0) [L11169] return ((unsigned long )ptr > 4294967295UL); [L12403] tmp___0 = ldv_is_err((void const *)res) [L12290] COND FALSE !(expression == 0) [L12406] return (res); [L9599] tmp = ldv_xmalloc(4UL) [L9600] cf_arg_2 = (struct ldv_struct_EMGentry_11 *)tmp [L10152-L10153] int (*ldv_2_callback_call)(struct sock * , struct sk_buff * , struct nlmsghdr * , struct nlattr ** ) ; [L10154] struct nlattr **ldv_2_container_struct_nlattr_ptr_ptr ; [L10155] struct nlmsghdr *ldv_2_container_struct_nlmsghdr_ptr ; [L10156] struct sk_buff *ldv_2_container_struct_sk_buff_ptr ; [L10157] struct sock *ldv_2_container_struct_sock_ptr ; [L10158] int tmp ; [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L10164] tmp = ldv_undef_int() [L10166] COND TRUE tmp != 0 [L8838] struct nfgenmsg *nfmsg ; [L8839] void *tmp ; [L8840] u_int16_t group_num ; [L8841] __u16 tmp___0 ; [L8842] struct nfulnl_instance *inst ; [L8843] struct nfulnl_msg_config_cmd *cmd ; [L8844] struct net *net ; [L8845] struct net *tmp___1 ; [L8846] struct nfnl_log_net *log ; [L8847] struct nfnl_log_net *tmp___2 ; [L8848] int ret ; [L8849] u_int8_t pf ; [L8850] void *tmp___3 ; [L8851] int tmp___4 ; [L8852] struct user_namespace *tmp___5 ; [L8853] long tmp___6 ; [L8854] bool tmp___7 ; [L8855] struct nfulnl_msg_config_mode *params ; [L8856] void *tmp___8 ; [L8857] __u32 tmp___9 ; [L8858] __be32 timeout ; [L8859] __be32 tmp___10 ; [L8860] __u32 tmp___11 ; [L8861] __be32 nlbufsiz ; [L8862] __be32 tmp___12 ; [L8863] __u32 tmp___13 ; [L8864] __be32 qthresh ; [L8865] __be32 tmp___14 ; [L8866] __u32 tmp___15 ; [L8867] __be16 flags ; [L8868] __be16 tmp___16 ; [L8869] __u16 tmp___17 ; [L7394] return ((void *)nlh + 16U); [L8872] tmp = nlmsg_data(nlh) [L8873] nfmsg = (struct nfgenmsg *)tmp [L8874] EXPR nfmsg->res_id [L6976] return ((__u16 )((int )((short )((int )val << 8)) | (int )((short )((int )val >> 8)))); [L8874] tmp___0 = __fswab16((int )nfmsg->res_id) [L8875] group_num = tmp___0 [L8876] cmd = (struct nfulnl_msg_config_cmd *)0 [L7490] struct net *tmp ; [L7343] EXPR \read(**pnet) [L7343] return ((struct net *)*pnet); [L7493] tmp = read_pnet(& sk->__sk_common.skc_net) [L7495] return (tmp); [L8877] tmp___1 = sock_net((struct sock const *)ctnl) [L8878] net = tmp___1 [L7617] void *tmp ; [L7620] EXPR \read(nfnl_log_net_id) [L7509] struct net_generic *ng ; [L7510] void *ptr ; [L7511] struct net_generic *________p1 ; [L7512] struct net_generic *_________p1 ; [L7513] struct net_generic *__var ; [L7514] bool __warned ; [L7515] int tmp ; [L7516] int tmp___0 ; [L7517] long tmp___1 ; [L7518] long tmp___2 ; [L7519] long tmp___3 ; [L11597] ldv_linux_kernel_rcu_update_lock_rcu_nested = ldv_linux_kernel_rcu_update_lock_rcu_nested + 1 [L7523] __var = (struct net_generic *)0 [L7524] EXPR net->gen [L7524] _________p1 = *((struct net_generic * const volatile *)(& net->gen)) [L7525] ________p1 = _________p1 [L15589] return __VERIFIER_nondet_int(); [L7526] tmp = debug_lockdep_rcu_enabled() [L7528] COND FALSE !(tmp != 0 && ! __warned) [L7542] ng = ________p1 [L12308] return (exp); [L7543] tmp___1 = ldv__builtin_expect(id == 0, 0L) [L7545] COND FALSE !(tmp___1 != 0L) [L7553] EXPR ng->len [L12308] return (exp); [L7553] tmp___2 = ldv__builtin_expect((unsigned int )id > ng->len, 0L) [L7555] COND FALSE !(tmp___2 != 0L) [L7565] EXPR ng->ptr[id + -1] [L7565] ptr = ng->ptr[id + -1] [L14889] COND FALSE !(! expr) [L11606] ldv_linux_kernel_rcu_update_lock_rcu_nested = ldv_linux_kernel_rcu_update_lock_rcu_nested - 1 [L12308] return (exp); [L7567] tmp___3 = ldv__builtin_expect((unsigned long )ptr == (unsigned long )((void *)0), 0L) [L7569] COND FALSE !(tmp___3 != 0L) [L7577] return (ptr); [L7620] tmp = net_generic((struct net const *)net, nfnl_log_net_id) [L7622] return ((struct nfnl_log_net *)tmp); [L8879] tmp___2 = nfnl_log_pernet(net) [L8880] log = tmp___2 [L8881] ret = 0 [L8883] EXPR nfula + 1UL [L8883] COND TRUE (unsigned long )*(nfula + 1UL) != (unsigned long )((struct nlattr const * )0) [L8885] EXPR nfmsg->nfgen_family [L8885] pf = nfmsg->nfgen_family [L8886] EXPR nfula + 1UL [L7439] return ((void *)nla + 4U); [L8886] tmp___3 = nla_data(*(nfula + 1UL)) [L8887] cmd = (struct nfulnl_msg_config_cmd *)tmp___3 [L8890] EXPR cmd->command [L8890] COND FALSE !((int )cmd->command == 3) [L8894] EXPR cmd->command [L8894] COND FALSE !((int )cmd->command == 4) [L7720] struct nfulnl_instance *inst ; [L7721] int tmp ; [L11519] ldv_linux_kernel_rcu_update_lock_bh_rcu_nested_bh = ldv_linux_kernel_rcu_update_lock_bh_rcu_nested_bh + 1 [L7633] struct hlist_head *head ; [L7634] struct nfulnl_instance *inst ; [L7635] u_int8_t tmp ; [L7636] struct hlist_node *____ptr ; [L7637] struct hlist_node *________p1 ; [L7638] struct hlist_node *_________p1 ; [L7639] struct hlist_node *__var ; [L7640] bool __warned ; [L7641] int tmp___0 ; [L7642] struct hlist_node const *__mptr ; [L7643] struct nfulnl_instance *tmp___1 ; [L7644] struct hlist_node *____ptr___0 ; [L7645] struct hlist_node *________p1___0 ; [L7646] struct hlist_node *_________p1___0 ; [L7647] struct hlist_node *__var___0 ; [L7648] bool __warned___0 ; [L7649] int tmp___2 ; [L7650] struct hlist_node const *__mptr___0 ; [L7651] struct nfulnl_instance *tmp___3 ; [L7628] return ((unsigned int )((u_int8_t )group_num) & 15U); [L7654] tmp = instance_hashfn((int )group_num) [L7655] head = (struct hlist_head *)(& log->instance_table) + (unsigned long )tmp [L7656] __var = (struct hlist_node *)0 [L7657] EXPR head->first [L7657] _________p1 = *((struct hlist_node * volatile *)(& head->first)) [L7658] ________p1 = _________p1 [L15589] return __VERIFIER_nondet_int(); [L7659] tmp___0 = debug_lockdep_rcu_enabled() [L7661] COND FALSE !(tmp___0 != 0 && ! __warned) [L7667] ____ptr = ________p1 [L7668] COND TRUE (unsigned long )____ptr != (unsigned long )((struct hlist_node *)0) [L7669] __mptr = (struct hlist_node const *)____ptr [L7670] tmp___1 = (struct nfulnl_instance *)__mptr [L7674] inst = tmp___1 [L7702] COND TRUE (unsigned long )inst != (unsigned long )((struct nfulnl_instance *)0) [L7677] EXPR inst->group_num [L7677] COND TRUE (int )inst->group_num == (int )group_num [L7678] return (inst); [L7725] inst = __instance_lookup(log, (int )group_num) [L7727] COND FALSE !((unsigned long )inst != (unsigned long )((struct nfulnl_instance *)0)) [L14951] COND FALSE !(! expr) [L11528] ldv_linux_kernel_rcu_update_lock_bh_rcu_nested_bh = ldv_linux_kernel_rcu_update_lock_bh_rcu_nested_bh - 1 [L7740] return (inst); [L8914] inst = instance_lookup_get(log, (int )group_num) [L8916] (unsigned long )inst != (unsigned long )((struct nfulnl_instance *)0) && (__u32 )inst->peer_portid != ((struct netlink_skb_parms *)(& skb->cb))->portid [L8916] COND FALSE !((unsigned long )inst != (unsigned long )((struct nfulnl_instance *)0) && (__u32 )inst->peer_portid != ((struct netlink_skb_parms *)(& skb->cb))->portid) [L8921] COND TRUE (unsigned long )cmd != (unsigned long )((struct nfulnl_msg_config_cmd *)0) [L8923] EXPR cmd->command [L8923] COND TRUE (int )cmd->command == 1 [L8933] COND FALSE !((unsigned long )inst != (unsigned long )((struct nfulnl_instance *)0)) [L8939] EXPR ((struct netlink_skb_parms *)(& skb->cb))->sk [L7485] EXPR sk->sk_socket [L7485] EXPR (sk->sk_socket)->file [L7485] EXPR ((sk->sk_socket)->file)->f_cred [L7485] EXPR (((sk->sk_socket)->file)->f_cred)->user_ns [L7485] return ((struct user_namespace *)(((sk->sk_socket)->file)->f_cred)->user_ns); [L8939] tmp___5 = sk_user_ns(((struct netlink_skb_parms *)(& skb->cb))->sk) [L8940] EXPR ((struct netlink_skb_parms *)(& skb->cb))->portid [L7781] struct nfulnl_instance *inst ; [L7782] struct nfnl_log_net *log ; [L7783] struct nfnl_log_net *tmp ; [L7784] int err ; [L7785] struct nfulnl_instance *tmp___0 ; [L7786] void *tmp___1 ; [L7787] bool tmp___2 ; [L7788] int tmp___3 ; [L7789] struct lock_class_key __key ; [L7790] struct lock_class_key __key___0 ; [L7791] u_int8_t tmp___4 ; [L7792] void *tmp___5 ; [L7617] void *tmp ; [L7620] EXPR \read(nfnl_log_net_id) [L7509] struct net_generic *ng ; [L7510] void *ptr ; [L7511] struct net_generic *________p1 ; [L7512] struct net_generic *_________p1 ; [L7513] struct net_generic *__var ; [L7514] bool __warned ; [L7515] int tmp ; [L7516] int tmp___0 ; [L7517] long tmp___1 ; [L7518] long tmp___2 ; [L7519] long tmp___3 ; [L11597] ldv_linux_kernel_rcu_update_lock_rcu_nested = ldv_linux_kernel_rcu_update_lock_rcu_nested + 1 [L7523] __var = (struct net_generic *)0 [L7524] EXPR net->gen [L7524] _________p1 = *((struct net_generic * const volatile *)(& net->gen)) [L7525] ________p1 = _________p1 [L15589] return __VERIFIER_nondet_int(); [L7526] tmp = debug_lockdep_rcu_enabled() [L7528] COND FALSE !(tmp != 0 && ! __warned) [L7542] ng = ________p1 [L12308] return (exp); [L7543] tmp___1 = ldv__builtin_expect(id == 0, 0L) [L7545] COND FALSE !(tmp___1 != 0L) [L7553] EXPR ng->len [L12308] return (exp); [L7553] tmp___2 = ldv__builtin_expect((unsigned int )id > ng->len, 0L) [L7555] COND FALSE !(tmp___2 != 0L) [L7565] EXPR ng->ptr[id + -1] [L7565] ptr = ng->ptr[id + -1] [L14889] COND FALSE !(! expr) [L11606] ldv_linux_kernel_rcu_update_lock_rcu_nested = ldv_linux_kernel_rcu_update_lock_rcu_nested - 1 [L12308] return (exp); [L7567] tmp___3 = ldv__builtin_expect((unsigned long )ptr == (unsigned long )((void *)0), 0L) [L7569] COND FALSE !(tmp___3 != 0L) [L7577] return (ptr); [L7620] tmp = net_generic((struct net const *)net, nfnl_log_net_id) [L7622] return ((struct nfnl_log_net *)tmp); [L7795] tmp = nfnl_log_pernet(net) [L7796] log = tmp [L15456] COND FALSE !(! expr) [L12290] COND FALSE !(expression == 0) [L13241] ldv_linux_kernel_locking_spinlock_spin_instances_lock_of_nfnl_log_net = 2 [L7633] struct hlist_head *head ; [L7634] struct nfulnl_instance *inst ; [L7635] u_int8_t tmp ; [L7636] struct hlist_node *____ptr ; [L7637] struct hlist_node *________p1 ; [L7638] struct hlist_node *_________p1 ; [L7639] struct hlist_node *__var ; [L7640] bool __warned ; [L7641] int tmp___0 ; [L7642] struct hlist_node const *__mptr ; [L7643] struct nfulnl_instance *tmp___1 ; [L7644] struct hlist_node *____ptr___0 ; [L7645] struct hlist_node *________p1___0 ; [L7646] struct hlist_node *_________p1___0 ; [L7647] struct hlist_node *__var___0 ; [L7648] bool __warned___0 ; [L7649] int tmp___2 ; [L7650] struct hlist_node const *__mptr___0 ; [L7651] struct nfulnl_instance *tmp___3 ; [L7628] return ((unsigned int )((u_int8_t )group_num) & 15U); [L7654] tmp = instance_hashfn((int )group_num) [L7655] head = (struct hlist_head *)(& log->instance_table) + (unsigned long )tmp [L7656] __var = (struct hlist_node *)0 [L7657] EXPR head->first [L7657] _________p1 = *((struct hlist_node * volatile *)(& head->first)) [L7658] ________p1 = _________p1 [L15589] return __VERIFIER_nondet_int(); [L7659] tmp___0 = debug_lockdep_rcu_enabled() [L7661] COND FALSE !(tmp___0 != 0 && ! __warned) [L7667] ____ptr = ________p1 [L7668] COND TRUE (unsigned long )____ptr != (unsigned long )((struct hlist_node *)0) [L7669] __mptr = (struct hlist_node const *)____ptr [L7670] tmp___1 = (struct nfulnl_instance *)__mptr [L7674] inst = tmp___1 [L7702] COND FALSE !((unsigned long )inst != (unsigned long )((struct nfulnl_instance *)0)) [L7706] return ((struct nfulnl_instance *)0); [L7798] tmp___0 = __instance_lookup(log, (int )group_num) [L7800] COND FALSE !((unsigned long )tmp___0 != (unsigned long )((struct nfulnl_instance *)0)) [L10451] void *tmp ; [L11734] void *res ; [L10689] bool tmp ; [L10690] int tmp___0 ; [L11687] return (__ldv_in_interrupt_context); [L10693] tmp = ldv_in_interrupt_context() [L10695] COND FALSE !(\read(tmp)) [L10698] tmp___0 = 1 [L15233] COND FALSE !(! expr) [L10756] COND FALSE !(ldv_linux_alloc_usb_lock_lock == 2) [L12376] void *tmp ; [L12352] void *res ; [L12353] void *tmp ; [L12354] long tmp___0 ; [L12355] int tmp___1 ; [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L12358] tmp___1 = ldv_undef_int() [L12360] COND TRUE tmp___1 != 0 [L12362] tmp = calloc(nmemb, size) [L12363] res = tmp [L12290] COND FALSE !(expression == 0) [L11169] return ((unsigned long )ptr > 4294967295UL); [L12365] tmp___0 = ldv_is_err((void const *)res) [L12290] COND FALSE !(expression == 0) [L12368] return (res); [L12379] tmp = ldv_calloc(1UL, size) [L12381] return (tmp); [L11738] res = ldv_zalloc(size) [L11741] return (res); [L10454] tmp = ldv_kzalloc(size, flags) [L10456] return (tmp); [L7806] tmp___1 = kzalloc(296UL, 32U) [L7807] inst = (struct nfulnl_instance *)tmp___1 [L7809] COND FALSE !((unsigned long )inst == (unsigned long )((struct nfulnl_instance *)0)) [L10489] int tmp ; [L11418] int tmp ; [L11420] COND TRUE (unsigned long )module != (unsigned long )((struct module *)0) [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L11422] tmp = ldv_undef_int() [L11424] COND TRUE tmp == 1 [L11425] ldv_linux_kernel_module_module_refcounter = ldv_linux_kernel_module_module_refcounter + 1 [L11426] return (1); [L10492] tmp = ldv_linux_kernel_module_try_module_get(ldv_func_arg1) [L10494] return (tmp != 0); [L7815] tmp___2 = ldv_try_module_get_131(& __this_module) [L7817] COND TRUE \read(tmp___2) [L7818] tmp___3 = 0 [L7822] COND FALSE !(\read(tmp___3)) [L7003] h->next = (struct hlist_node *)0 [L7004] h->pprev = (struct hlist_node **)0 [L7165] return (& lock->__annonCompField18.rlock); [L7041] v->counter = i [L7837] inst->timer.function = & nfulnl_timer [L7838] inst->timer.data = (unsigned long )inst [L10854] EXPR v->counter [L10854] v->counter = v->counter + 1 [L7321] return (net); [L7839] inst->net = get_net(net) [L7840] inst->peer_user_ns = user_ns [L7841] inst->peer_portid = portid [L7842] inst->group_num = group_num [L7843] inst->qthreshold = 100U [L7844] inst->flushtimeout = 100U [L7845] inst->nlbufsiz = 3776U [L7846] inst->copy_mode = 2U [L7847] inst->copy_range = 65531U [L7628] return ((unsigned int )((u_int8_t )group_num) & 15U); [L7848] tmp___4 = instance_hashfn((int )group_num) [L14963] COND FALSE !(! expr) [L15542] COND FALSE !(! expr) [L14901] COND FALSE !(! expr) [L14727] COND FALSE !(! expr) [L15480] COND FALSE !(! expr) [L12290] COND FALSE !(expression == 0) [L13252] ldv_linux_kernel_locking_spinlock_spin_instances_lock_of_nfnl_log_net = 1 [L7852] return (inst); [L7852] return (inst); [L7852] return (inst); [L8940-L8941] inst = instance_create(net, (int )group_num, (int )((struct netlink_skb_parms *)(& skb->cb))->portid, tmp___5) [L7021] long tmp ; [L12308] return (exp); [L7024] tmp = ldv__builtin_expect((unsigned long )ptr > 0xfffffffffffff000UL, 0L) [L7026] return (tmp != 0L); [L8942] tmp___7 = IS_ERR((void const *)inst) [L8944] COND TRUE (int )tmp___7 [L10357] long tmp ; [L11181] return ((long )(4294967295UL - (unsigned long )ptr)); [L10360] tmp = ldv_ptr_err(ptr) [L10362] return (tmp); [L8946] tmp___6 = PTR_ERR((void const *)inst) [L8947] ret = (int )tmp___6 [L9056] return (ret); [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L10164] tmp = ldv_undef_int() [L10166] COND FALSE !(tmp != 0) [L12395] void *res ; [L12396] void *tmp ; [L12397] long tmp___0 ; [L12400] tmp = malloc(size) [L12401] res = tmp [L12290] COND FALSE !(expression == 0) [L11169] return ((unsigned long )ptr > 4294967295UL); [L12403] tmp___0 = ldv_is_err((void const *)res) [L12290] COND FALSE !(expression == 0) [L12406] return (res); [L9602] tmp___0 = ldv_xmalloc(4UL) [L9603] cf_arg_3 = (struct ldv_struct_EMGentry_11 *)tmp___0 [L10182-L10183] int (*ldv_3_callback_call)(struct sock * , struct sk_buff * , struct nlmsghdr * , struct nlattr ** ) ; [L10184] struct nlattr **ldv_3_container_struct_nlattr_ptr_ptr ; [L10185] struct nlmsghdr *ldv_3_container_struct_nlmsghdr_ptr ; [L10186] struct sk_buff *ldv_3_container_struct_sk_buff_ptr ; [L10187] struct sock *ldv_3_container_struct_sock_ptr ; [L10188] int tmp ; [L12430] int tmp ; [L12433] tmp = __VERIFIER_nondet_int() [L12435] return (tmp); [L10194] tmp = ldv_undef_int() [L10196] COND FALSE !(tmp != 0) [L9580] struct ldv_struct_EMGentry_11 *cf_arg_7 ; [L9581] void *tmp ; [L12395] void *res ; [L12396] void *tmp ; [L12397] long tmp___0 ; [L12400] tmp = malloc(size) [L12401] res = tmp [L12290] COND FALSE !(expression == 0) [L11169] return ((unsigned long )ptr > 4294967295UL); [L12403] tmp___0 = ldv_is_err((void const *)res) [L12290] COND FALSE !(expression == 0) [L12406] return (res); [L9584] tmp = ldv_xmalloc(4UL) [L9585] cf_arg_7 = (struct ldv_struct_EMGentry_11 *)tmp [L10298] struct timer_list *ldv_7_container_timer_list ; [L9552] struct ldv_struct_timer_instance_6 *cf_arg_6 ; [L9553] void *tmp ; [L12395] void *res ; [L12396] void *tmp ; [L12397] long tmp___0 ; [L12400] tmp = malloc(size) [L12401] res = tmp [L12290] COND FALSE !(expression == 0) [L11169] return ((unsigned long )ptr > 4294967295UL); [L12403] tmp___0 = ldv_is_err((void const *)res) [L12290] COND FALSE !(expression == 0) [L12406] return (res); [L9556] tmp = ldv_xmalloc(16UL) [L9557] cf_arg_6 = (struct ldv_struct_timer_instance_6 *)tmp [L9558] cf_arg_6->arg0 = arg0 [L10318] struct timer_list *ldv_6_container_timer_list ; [L10319] struct ldv_struct_timer_instance_6 *data ; [L10321] data = (struct ldv_struct_timer_instance_6 *)arg0 [L10322] COND TRUE (unsigned long )data != (unsigned long )((struct ldv_struct_timer_instance_6 *)0) [L10324] EXPR data->arg0 [L10324] ldv_6_container_timer_list = data->arg0 [L11673] __ldv_in_interrupt_context = 1 [L10332] EXPR ldv_6_container_timer_list->function [L10332] COND FALSE !((unsigned long )ldv_6_container_timer_list->function != (unsigned long )((void (*)(unsigned long ))0)) [L11680] __ldv_in_interrupt_context = 0 [L15656] return __VERIFIER_nondet_int(); [L10594] ldv_func_ret_type___4 ldv_func_res ; [L10595] int tmp ; [L10596] int tmp___0 ; [L15628] return __VERIFIER_nondet_int(); [L10599] tmp = netlink_unregister_notifier(ldv_func_arg1) [L10600] ldv_func_res = tmp [L9999] struct notifier_block *ldv_9_struct_notifier_block_struct_notifier_block ; [L10002] ldv_9_struct_notifier_block_struct_notifier_block = arg1 [L10005] return (arg0); [L10601] tmp___0 = ldv_netlink_unregister_notifier(ldv_func_res, ldv_func_arg1) [L10603] return (tmp___0); [L15405] COND FALSE !(! expr) [L15380] COND FALSE !(! expr) [L15319] COND FALSE !(! expr) [L15220] COND FALSE !(! expr) [L15282] COND FALSE !(! expr) [L14702] COND FALSE !(! expr) [L15443] COND FALSE !(! expr) [L14542] COND FALSE !(! expr) [L14578] COND FALSE !(! expr) [L14764] COND TRUE ! expr [L14766] reach_error() - UnprovableResult [Line: 14891]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15458]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14965]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15544]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14903]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14729]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15458]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14965]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15544]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14903]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14729]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15482]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14965]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15544]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14903]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14729]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15482]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15407]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15382]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15321]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15222]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15284]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14704]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15445]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14544]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14580]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14766]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14977]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15556]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14915]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14741]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14629]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14853]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14495]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14928]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14878]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15160]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15519]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14953]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14891]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14891]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14891]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14891]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14891]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14953]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14891]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15458]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15235]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15173]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14965]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15544]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14903]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14729]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15482]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15482]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15458]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14965]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15544]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14903]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14729]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15458]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14965]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15544]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14903]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14729]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15482]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14965]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15544]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14903]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14729]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15482]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15458]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15482]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15458]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15482]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15458]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15482]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15458]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15482]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15458]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15482]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14965]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15544]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14903]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14729]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15458]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15482]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14965]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15544]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14903]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14729]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15407]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15382]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15321]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15222]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15284]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14704]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15445]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14544]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14580]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14977]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15556]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14915]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14741]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14629]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14853]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14495]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14928]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14878]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15160]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15519]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1428 locations, 112 error locations. Started 1 CEGAR loops. OverallTime: 469470.80ms, OverallIterations: 64, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 121.86ms, AutomataDifference: 118010.89ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 21.52ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93733 SdHoareTripleChecker+Valid, 14185.58ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93733 mSDsluCounter, 335926 SdHoareTripleChecker+Invalid, 12263.07ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 32500 IncrementalHoareTripleChecker+Unchecked, 242842 mSDsCounter, 504 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6280 IncrementalHoareTripleChecker+Invalid, 39284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 504 mSolverCounterUnsat, 93084 mSDtfsCounter, 6280 mSolverCounterSat, 384.10ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9081 GetRequests, 8607 SyntacticMatches, 25 SemanticMatches, 449 ConstructedPredicates, 84 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 301089.93ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3171occurred in iteration=18, InterpolantAutomatonStates: 385, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 13426.91ms AutomataMinimizationTime, 63 MinimizatonAttempts, 32720 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2689.12ms SsaConstructionTime, 23082.36ms SatisfiabilityAnalysisTime, 303211.36ms InterpolantComputationTime, 11538 NumberOfCodeBlocks, 11538 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 15319 ConstructedInterpolants, 2102 QuantifiedInterpolants, 155497 SizeOfPredicates, 339 NumberOfNonLiveVariables, 54842 ConjunctsInSsa, 483 ConjunctsInUnsatCore, 83 InterpolantComputations, 50 PerfectInterpolantSequences, 642/1090 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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---net--netfilter--nfnetlink_log.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 13180db7de3a8489ee06ea96825d5be5d06449dd3c867f58676a7914255b860c --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-06 00:06:11,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 00:06:11,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 00:06:11,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 00:06:11,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 00:06:11,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 00:06:11,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 00:06:11,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 00:06:11,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 00:06:11,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 00:06:11,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 00:06:11,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 00:06:11,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 00:06:11,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 00:06:11,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 00:06:11,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 00:06:11,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 00:06:11,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 00:06:11,717 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 00:06:11,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 00:06:11,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 00:06:11,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 00:06:11,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 00:06:11,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 00:06:11,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 00:06:11,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 00:06:11,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 00:06:11,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 00:06:11,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 00:06:11,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 00:06:11,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 00:06:11,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 00:06:11,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 00:06:11,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 00:06:11,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 00:06:11,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 00:06:11,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 00:06:11,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 00:06:11,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 00:06:11,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 00:06:11,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 00:06:11,746 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-06 00:06:11,781 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 00:06:11,781 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 00:06:11,782 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 00:06:11,782 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 00:06:11,784 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 00:06:11,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 00:06:11,784 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 00:06:11,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 00:06:11,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 00:06:11,785 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 00:06:11,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 00:06:11,786 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 00:06:11,786 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-06 00:06:11,786 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-06 00:06:11,786 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 00:06:11,786 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 00:06:11,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 00:06:11,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 00:06:11,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 00:06:11,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 00:06:11,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 00:06:11,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 00:06:11,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 00:06:11,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 00:06:11,796 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-06 00:06:11,797 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-06 00:06:11,797 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 00:06:11,797 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 00:06:11,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 00:06:11,798 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 00:06:11,798 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-06 00:06:11,798 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 13180db7de3a8489ee06ea96825d5be5d06449dd3c867f58676a7914255b860c [2021-11-06 00:06:12,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 00:06:12,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 00:06:12,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 00:06:12,119 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 00:06:12,119 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 00:06:12,121 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---net--netfilter--nfnetlink_log.ko.cil.i [2021-11-06 00:06:12,181 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91e924db3/46cd578025c74917a46c3d49b3fde408/FLAG033b0cbd5 [2021-11-06 00:06:12,907 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 00:06:12,907 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2021-11-06 00:06:12,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91e924db3/46cd578025c74917a46c3d49b3fde408/FLAG033b0cbd5 [2021-11-06 00:06:12,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91e924db3/46cd578025c74917a46c3d49b3fde408 [2021-11-06 00:06:12,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 00:06:12,989 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 00:06:12,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 00:06:12,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 00:06:12,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 00:06:12,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:06:12" (1/1) ... [2021-11-06 00:06:12,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16664bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:06:12, skipping insertion in model container [2021-11-06 00:06:12,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:06:12" (1/1) ... [2021-11-06 00:06:13,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 00:06:13,142 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 00:06:15,903 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400642,400655] [2021-11-06 00:06:15,906 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400787,400800] [2021-11-06 00:06:15,906 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400933,400946] [2021-11-06 00:06:15,907 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401098,401111] [2021-11-06 00:06:15,907 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401256,401269] [2021-11-06 00:06:15,907 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401414,401427] [2021-11-06 00:06:15,908 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401572,401585] [2021-11-06 00:06:15,908 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401732,401745] [2021-11-06 00:06:15,908 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401891,401904] [2021-11-06 00:06:15,909 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402030,402043] [2021-11-06 00:06:15,909 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402172,402185] [2021-11-06 00:06:15,909 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402321,402334] [2021-11-06 00:06:15,910 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402460,402473] [2021-11-06 00:06:15,910 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402615,402628] [2021-11-06 00:06:15,911 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402775,402788] [2021-11-06 00:06:15,911 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402926,402939] [2021-11-06 00:06:15,911 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403077,403090] [2021-11-06 00:06:15,912 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403229,403242] [2021-11-06 00:06:15,912 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403378,403391] [2021-11-06 00:06:15,912 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403526,403539] [2021-11-06 00:06:15,913 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403683,403696] [2021-11-06 00:06:15,913 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403832,403845] [2021-11-06 00:06:15,913 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403988,404001] [2021-11-06 00:06:15,914 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404141,404154] [2021-11-06 00:06:15,914 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404287,404300] [2021-11-06 00:06:15,914 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404430,404443] [2021-11-06 00:06:15,915 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404582,404595] [2021-11-06 00:06:15,915 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404728,404741] [2021-11-06 00:06:15,915 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404873,404886] [2021-11-06 00:06:15,916 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405027,405040] [2021-11-06 00:06:15,916 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405178,405191] [2021-11-06 00:06:15,917 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405333,405346] [2021-11-06 00:06:15,917 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405485,405498] [2021-11-06 00:06:15,917 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405640,405653] [2021-11-06 00:06:15,918 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405804,405817] [2021-11-06 00:06:15,918 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405960,405973] [2021-11-06 00:06:15,918 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406124,406137] [2021-11-06 00:06:15,919 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406266,406279] [2021-11-06 00:06:15,919 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406424,406437] [2021-11-06 00:06:15,919 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406591,406604] [2021-11-06 00:06:15,920 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406750,406763] [2021-11-06 00:06:15,920 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406909,406922] [2021-11-06 00:06:15,920 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407058,407071] [2021-11-06 00:06:15,921 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407205,407218] [2021-11-06 00:06:15,921 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407344,407357] [2021-11-06 00:06:15,921 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407507,407520] [2021-11-06 00:06:15,922 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407673,407686] [2021-11-06 00:06:15,922 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407837,407850] [2021-11-06 00:06:15,922 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408002,408015] [2021-11-06 00:06:15,923 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408167,408180] [2021-11-06 00:06:15,923 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408333,408346] [2021-11-06 00:06:15,923 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408498,408511] [2021-11-06 00:06:15,924 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408665,408678] [2021-11-06 00:06:15,924 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408825,408838] [2021-11-06 00:06:15,924 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408987,409000] [2021-11-06 00:06:15,925 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409146,409159] [2021-11-06 00:06:15,925 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409292,409305] [2021-11-06 00:06:15,925 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409435,409448] [2021-11-06 00:06:15,926 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409579,409592] [2021-11-06 00:06:15,926 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409722,409735] [2021-11-06 00:06:15,926 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409866,409879] [2021-11-06 00:06:15,927 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410007,410020] [2021-11-06 00:06:15,927 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410145,410158] [2021-11-06 00:06:15,927 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410303,410316] [2021-11-06 00:06:15,928 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410462,410475] [2021-11-06 00:06:15,928 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410618,410631] [2021-11-06 00:06:15,928 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410767,410780] [2021-11-06 00:06:15,929 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410919,410932] [2021-11-06 00:06:15,929 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411070,411083] [2021-11-06 00:06:15,929 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411219,411232] [2021-11-06 00:06:15,930 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411371,411384] [2021-11-06 00:06:15,930 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411519,411532] [2021-11-06 00:06:15,930 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411672,411685] [2021-11-06 00:06:15,931 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411823,411836] [2021-11-06 00:06:15,931 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411973,411986] [2021-11-06 00:06:15,931 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412120,412133] [2021-11-06 00:06:15,932 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412271,412284] [2021-11-06 00:06:15,932 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412422,412435] [2021-11-06 00:06:15,932 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412570,412583] [2021-11-06 00:06:15,933 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412736,412749] [2021-11-06 00:06:15,933 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412905,412918] [2021-11-06 00:06:15,933 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413072,413085] [2021-11-06 00:06:15,934 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413240,413253] [2021-11-06 00:06:15,934 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413390,413403] [2021-11-06 00:06:15,934 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413537,413550] [2021-11-06 00:06:15,935 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413698,413711] [2021-11-06 00:06:15,935 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413868,413881] [2021-11-06 00:06:15,936 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[414030,414043] [2021-11-06 00:06:15,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 00:06:15,993 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 00:06:16,279 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400642,400655] [2021-11-06 00:06:16,280 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400787,400800] [2021-11-06 00:06:16,280 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400933,400946] [2021-11-06 00:06:16,281 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401098,401111] [2021-11-06 00:06:16,281 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401256,401269] [2021-11-06 00:06:16,282 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401414,401427] [2021-11-06 00:06:16,282 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401572,401585] [2021-11-06 00:06:16,283 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401732,401745] [2021-11-06 00:06:16,283 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401891,401904] [2021-11-06 00:06:16,283 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402030,402043] [2021-11-06 00:06:16,284 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402172,402185] [2021-11-06 00:06:16,284 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402321,402334] [2021-11-06 00:06:16,284 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402460,402473] [2021-11-06 00:06:16,285 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402615,402628] [2021-11-06 00:06:16,285 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402775,402788] [2021-11-06 00:06:16,285 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402926,402939] [2021-11-06 00:06:16,285 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403077,403090] [2021-11-06 00:06:16,286 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403229,403242] [2021-11-06 00:06:16,286 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403378,403391] [2021-11-06 00:06:16,286 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403526,403539] [2021-11-06 00:06:16,286 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403683,403696] [2021-11-06 00:06:16,287 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403832,403845] [2021-11-06 00:06:16,287 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403988,404001] [2021-11-06 00:06:16,288 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404141,404154] [2021-11-06 00:06:16,288 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404287,404300] [2021-11-06 00:06:16,288 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404430,404443] [2021-11-06 00:06:16,289 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404582,404595] [2021-11-06 00:06:16,289 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404728,404741] [2021-11-06 00:06:16,289 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404873,404886] [2021-11-06 00:06:16,289 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405027,405040] [2021-11-06 00:06:16,290 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405178,405191] [2021-11-06 00:06:16,290 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405333,405346] [2021-11-06 00:06:16,290 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405485,405498] [2021-11-06 00:06:16,290 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405640,405653] [2021-11-06 00:06:16,291 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405804,405817] [2021-11-06 00:06:16,291 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405960,405973] [2021-11-06 00:06:16,292 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406124,406137] [2021-11-06 00:06:16,292 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406266,406279] [2021-11-06 00:06:16,293 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406424,406437] [2021-11-06 00:06:16,293 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406591,406604] [2021-11-06 00:06:16,294 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406750,406763] [2021-11-06 00:06:16,294 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406909,406922] [2021-11-06 00:06:16,295 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407058,407071] [2021-11-06 00:06:16,296 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407205,407218] [2021-11-06 00:06:16,296 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407344,407357] [2021-11-06 00:06:16,296 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407507,407520] [2021-11-06 00:06:16,296 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407673,407686] [2021-11-06 00:06:16,297 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407837,407850] [2021-11-06 00:06:16,297 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408002,408015] [2021-11-06 00:06:16,297 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408167,408180] [2021-11-06 00:06:16,298 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408333,408346] [2021-11-06 00:06:16,301 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408498,408511] [2021-11-06 00:06:16,302 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408665,408678] [2021-11-06 00:06:16,302 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408825,408838] [2021-11-06 00:06:16,302 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408987,409000] [2021-11-06 00:06:16,303 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409146,409159] [2021-11-06 00:06:16,303 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409292,409305] [2021-11-06 00:06:16,303 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409435,409448] [2021-11-06 00:06:16,303 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409579,409592] [2021-11-06 00:06:16,304 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409722,409735] [2021-11-06 00:06:16,304 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409866,409879] [2021-11-06 00:06:16,305 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410007,410020] [2021-11-06 00:06:16,305 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410145,410158] [2021-11-06 00:06:16,308 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410303,410316] [2021-11-06 00:06:16,308 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410462,410475] [2021-11-06 00:06:16,309 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410618,410631] [2021-11-06 00:06:16,309 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410767,410780] [2021-11-06 00:06:16,310 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410919,410932] [2021-11-06 00:06:16,310 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411070,411083] [2021-11-06 00:06:16,311 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411219,411232] [2021-11-06 00:06:16,311 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411371,411384] [2021-11-06 00:06:16,311 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411519,411532] [2021-11-06 00:06:16,317 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411672,411685] [2021-11-06 00:06:16,317 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411823,411836] [2021-11-06 00:06:16,317 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411973,411986] [2021-11-06 00:06:16,318 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412120,412133] [2021-11-06 00:06:16,318 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412271,412284] [2021-11-06 00:06:16,318 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412422,412435] [2021-11-06 00:06:16,319 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412570,412583] [2021-11-06 00:06:16,320 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412736,412749] [2021-11-06 00:06:16,320 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412905,412918] [2021-11-06 00:06:16,321 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413072,413085] [2021-11-06 00:06:16,321 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413240,413253] [2021-11-06 00:06:16,322 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413390,413403] [2021-11-06 00:06:16,322 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413537,413550] [2021-11-06 00:06:16,322 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413698,413711] [2021-11-06 00:06:16,322 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413868,413881] [2021-11-06 00:06:16,323 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[414030,414043] [2021-11-06 00:06:16,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 00:06:16,511 INFO L208 MainTranslator]: Completed translation [2021-11-06 00:06:16,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:06:16 WrapperNode [2021-11-06 00:06:16,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 00:06:16,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 00:06:16,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 00:06:16,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 00:06:16,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:06:16" (1/1) ... [2021-11-06 00:06:16,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:06:16" (1/1) ... [2021-11-06 00:06:16,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 00:06:16,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 00:06:16,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 00:06:16,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 00:06:16,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:06:16" (1/1) ... [2021-11-06 00:06:16,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:06:16" (1/1) ... [2021-11-06 00:06:16,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:06:16" (1/1) ... [2021-11-06 00:06:16,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:06:16" (1/1) ... [2021-11-06 00:06:16,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:06:16" (1/1) ... [2021-11-06 00:06:16,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:06:16" (1/1) ... [2021-11-06 00:06:16,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:06:16" (1/1) ... [2021-11-06 00:06:17,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 00:06:17,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 00:06:17,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 00:06:17,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 00:06:17,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:06:16" (1/1) ... [2021-11-06 00:06:17,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 00:06:17,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:06:17,037 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 00:06:17,060 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 00:06:17,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 00:06:17,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-11-06 00:06:17,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-06 00:06:17,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-06 00:06:17,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-06 00:06:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 00:06:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 00:06:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 00:06:17,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 00:06:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-06 00:06:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure __cmpxchg_wrong_size [2021-11-06 00:06:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-06 00:06:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-06 00:06:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2021-11-06 00:06:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 00:06:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 00:06:17,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-06 00:06:17,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-06 00:06:17,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-06 00:06:17,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-06 00:06:17,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 00:06:25,686 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L9761: #t~ret860 := main_#res; [2021-11-06 00:06:25,687 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-06 00:06:25,687 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_11_returnLabel: main_#res := 0bv32; [2021-11-06 00:06:25,706 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 00:06:25,706 INFO L299 CfgBuilder]: Removed 1678 assume(true) statements. [2021-11-06 00:06:25,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:06:25 BoogieIcfgContainer [2021-11-06 00:06:25,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 00:06:25,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 00:06:25,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 00:06:25,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 00:06:25,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:06:12" (1/3) ... [2021-11-06 00:06:25,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790d70a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:06:25, skipping insertion in model container [2021-11-06 00:06:25,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:06:16" (2/3) ... [2021-11-06 00:06:25,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790d70a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:06:25, skipping insertion in model container [2021-11-06 00:06:25,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:06:25" (3/3) ... [2021-11-06 00:06:25,715 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2021-11-06 00:06:25,719 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 00:06:25,720 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 112 error locations. [2021-11-06 00:06:25,761 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 00:06:25,766 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 00:06:25,766 INFO L340 AbstractCegarLoop]: Starting to check reachability of 112 error locations. [2021-11-06 00:06:25,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 1427 states, 1315 states have (on average 1.388593155893536) internal successors, (1826), 1426 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:25,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-06 00:06:25,802 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:25,803 INFO L514 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 00:06:25,803 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:25,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:25,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1114166620, now seen corresponding path program 1 times [2021-11-06 00:06:25,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:25,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793047084] [2021-11-06 00:06:25,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:25,818 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:25,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:25,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:25,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-06 00:06:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:26,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-06 00:06:26,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:27,023 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 00:06:27,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:27,220 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 00:06:27,221 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:27,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793047084] [2021-11-06 00:06:27,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793047084] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:27,222 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:27,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 13 [2021-11-06 00:06:27,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263163865] [2021-11-06 00:06:27,224 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:27,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 00:06:27,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:27,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 00:06:27,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-11-06 00:06:27,252 INFO L87 Difference]: Start difference. First operand has 1427 states, 1315 states have (on average 1.388593155893536) internal successors, (1826), 1426 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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 00:06:30,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:30,285 INFO L93 Difference]: Finished difference Result 4814 states and 6159 transitions. [2021-11-06 00:06:30,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-06 00:06:30,287 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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 32 [2021-11-06 00:06:30,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:30,311 INFO L225 Difference]: With dead ends: 4814 [2021-11-06 00:06:30,311 INFO L226 Difference]: Without dead ends: 3221 [2021-11-06 00:06:30,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1032.75ms TimeCoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2021-11-06 00:06:30,320 INFO L933 BasicCegarLoop]: 1670 mSDtfsCounter, 16856 mSDsluCounter, 19960 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1615.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 16856 SdHoareTripleChecker+Valid, 21630 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 46.14ms SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1838.45ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:30,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16856 Valid, 21630 Invalid, 1025 Unknown, 0 Unchecked, 46.14ms Time], IncrementalHoareTripleChecker [287 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 1838.45ms Time] [2021-11-06 00:06:30,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3221 states. [2021-11-06 00:06:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3221 to 1343. [2021-11-06 00:06:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1231 states have (on average 1.2307067424857838) internal successors, (1515), 1342 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1515 transitions. [2021-11-06 00:06:30,420 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1515 transitions. Word has length 32 [2021-11-06 00:06:30,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:30,420 INFO L470 AbstractCegarLoop]: Abstraction has 1343 states and 1515 transitions. [2021-11-06 00:06:30,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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 00:06:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1515 transitions. [2021-11-06 00:06:30,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-06 00:06:30,422 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:30,422 INFO L514 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 00:06:30,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-06 00:06:30,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:30,636 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:30,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:30,636 INFO L85 PathProgramCache]: Analyzing trace with hash 877214148, now seen corresponding path program 1 times [2021-11-06 00:06:30,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:30,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9635452] [2021-11-06 00:06:30,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:30,638 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:30,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:30,639 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:30,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-06 00:06:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:31,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:06:31,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:31,455 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 00:06:31,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:31,593 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 00:06:31,593 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:31,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9635452] [2021-11-06 00:06:31,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9635452] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:31,593 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:31,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:06:31,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664735784] [2021-11-06 00:06:31,594 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:31,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:06:31,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:31,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:06:31,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:06:31,595 INFO L87 Difference]: Start difference. First operand 1343 states and 1515 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 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 00:06:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:31,654 INFO L93 Difference]: Finished difference Result 1343 states and 1515 transitions. [2021-11-06 00:06:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:06:31,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 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 33 [2021-11-06 00:06:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:31,659 INFO L225 Difference]: With dead ends: 1343 [2021-11-06 00:06:31,659 INFO L226 Difference]: Without dead ends: 1339 [2021-11-06 00:06:31,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.92ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:06:31,660 INFO L933 BasicCegarLoop]: 1496 mSDtfsCounter, 1790 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1790 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.98ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.12ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:31,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1790 Valid, 2834 Invalid, 7 Unknown, 0 Unchecked, 6.98ms Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 9.12ms Time] [2021-11-06 00:06:31,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2021-11-06 00:06:31,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1339. [2021-11-06 00:06:31,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1229 states have (on average 1.2294548413344182) internal successors, (1511), 1338 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1511 transitions. [2021-11-06 00:06:31,697 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1511 transitions. Word has length 33 [2021-11-06 00:06:31,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:31,698 INFO L470 AbstractCegarLoop]: Abstraction has 1339 states and 1511 transitions. [2021-11-06 00:06:31,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 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 00:06:31,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1511 transitions. [2021-11-06 00:06:31,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-06 00:06:31,699 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:31,699 INFO L514 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 00:06:31,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-06 00:06:31,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:31,919 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:31,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:31,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1189355176, now seen corresponding path program 1 times [2021-11-06 00:06:31,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:31,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515076384] [2021-11-06 00:06:31,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:31,921 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:31,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:31,922 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:31,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-06 00:06:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:32,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:06:32,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:32,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 00:06:32,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:32,836 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 00:06:32,836 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:32,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515076384] [2021-11-06 00:06:32,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515076384] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:32,837 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:32,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:06:32,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448787078] [2021-11-06 00:06:32,837 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:32,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:06:32,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:32,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:06:32,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:06:32,838 INFO L87 Difference]: Start difference. First operand 1339 states and 1511 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:32,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:32,898 INFO L93 Difference]: Finished difference Result 1339 states and 1511 transitions. [2021-11-06 00:06:32,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:06:32,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-06 00:06:32,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:32,903 INFO L225 Difference]: With dead ends: 1339 [2021-11-06 00:06:32,904 INFO L226 Difference]: Without dead ends: 1335 [2021-11-06 00:06:32,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.11ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:06:32,905 INFO L933 BasicCegarLoop]: 1492 mSDtfsCounter, 1768 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1768 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.49ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.27ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:32,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1768 Valid, 2834 Invalid, 7 Unknown, 0 Unchecked, 3.49ms Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 10.27ms Time] [2021-11-06 00:06:32,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2021-11-06 00:06:32,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1335. [2021-11-06 00:06:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 1227 states have (on average 1.228198859005705) internal successors, (1507), 1334 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1507 transitions. [2021-11-06 00:06:32,945 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1507 transitions. Word has length 35 [2021-11-06 00:06:32,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:32,946 INFO L470 AbstractCegarLoop]: Abstraction has 1335 states and 1507 transitions. [2021-11-06 00:06:32,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1507 transitions. [2021-11-06 00:06:32,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 00:06:32,947 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:32,947 INFO L514 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 00:06:32,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-06 00:06:33,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:33,162 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:33,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:33,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1801578912, now seen corresponding path program 1 times [2021-11-06 00:06:33,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:33,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373106170] [2021-11-06 00:06:33,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:33,168 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:33,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:33,169 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:33,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-06 00:06:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:33,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:06:33,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:33,961 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 00:06:33,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:34,135 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 00:06:34,135 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:34,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373106170] [2021-11-06 00:06:34,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373106170] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:34,136 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:34,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-06 00:06:34,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130694703] [2021-11-06 00:06:34,136 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:34,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 00:06:34,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:34,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 00:06:34,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-06 00:06:34,138 INFO L87 Difference]: Start difference. First operand 1335 states and 1507 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:36,181 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:06:36,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:36,762 INFO L93 Difference]: Finished difference Result 1936 states and 2166 transitions. [2021-11-06 00:06:36,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 00:06:36,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-06 00:06:36,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:36,770 INFO L225 Difference]: With dead ends: 1936 [2021-11-06 00:06:36,771 INFO L226 Difference]: Without dead ends: 1922 [2021-11-06 00:06:36,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 72.83ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-06 00:06:36,772 INFO L933 BasicCegarLoop]: 2076 mSDtfsCounter, 3062 mSDsluCounter, 3381 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2403.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3062 SdHoareTripleChecker+Valid, 5457 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.82ms SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2477.82ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:36,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3062 Valid, 5457 Invalid, 182 Unknown, 0 Unchecked, 13.82ms Time], IncrementalHoareTripleChecker [55 Valid, 126 Invalid, 1 Unknown, 0 Unchecked, 2477.82ms Time] [2021-11-06 00:06:36,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2021-11-06 00:06:36,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1321. [2021-11-06 00:06:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1220 states have (on average 1.2237704918032788) internal successors, (1493), 1320 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1493 transitions. [2021-11-06 00:06:36,862 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1493 transitions. Word has length 36 [2021-11-06 00:06:36,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:36,862 INFO L470 AbstractCegarLoop]: Abstraction has 1321 states and 1493 transitions. [2021-11-06 00:06:36,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1493 transitions. [2021-11-06 00:06:36,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-06 00:06:36,864 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:36,864 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:06:36,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-06 00:06:37,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:37,083 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:37,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:37,084 INFO L85 PathProgramCache]: Analyzing trace with hash 509172716, now seen corresponding path program 1 times [2021-11-06 00:06:37,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:37,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238212098] [2021-11-06 00:06:37,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:37,085 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:37,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:37,086 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:37,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-06 00:06:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:37,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:06:37,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:37,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 00:06:37,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:37,899 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 00:06:37,899 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:37,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238212098] [2021-11-06 00:06:37,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238212098] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:37,900 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:37,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:06:37,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753098839] [2021-11-06 00:06:37,900 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:37,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:06:37,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:37,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:06:37,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:06:37,901 INFO L87 Difference]: Start difference. First operand 1321 states and 1493 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:37,995 INFO L93 Difference]: Finished difference Result 1321 states and 1493 transitions. [2021-11-06 00:06:37,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:06:37,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-06 00:06:37,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:38,000 INFO L225 Difference]: With dead ends: 1321 [2021-11-06 00:06:38,001 INFO L226 Difference]: Without dead ends: 1317 [2021-11-06 00:06:38,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.08ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:06:38,002 INFO L933 BasicCegarLoop]: 1474 mSDtfsCounter, 1588 mSDsluCounter, 2664 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 4138 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.15ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.53ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:38,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1588 Valid, 4138 Invalid, 6 Unknown, 0 Unchecked, 4.15ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 10.53ms Time] [2021-11-06 00:06:38,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2021-11-06 00:06:38,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1317. [2021-11-06 00:06:38,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1218 states have (on average 1.222495894909688) internal successors, (1489), 1316 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1489 transitions. [2021-11-06 00:06:38,063 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1489 transitions. Word has length 37 [2021-11-06 00:06:38,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:38,063 INFO L470 AbstractCegarLoop]: Abstraction has 1317 states and 1489 transitions. [2021-11-06 00:06:38,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:38,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1489 transitions. [2021-11-06 00:06:38,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-06 00:06:38,067 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:38,067 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:06:38,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-06 00:06:38,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:38,288 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:38,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:38,288 INFO L85 PathProgramCache]: Analyzing trace with hash -311142000, now seen corresponding path program 1 times [2021-11-06 00:06:38,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:38,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839376774] [2021-11-06 00:06:38,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:38,290 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:38,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:38,291 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:38,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-06 00:06:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:38,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:06:38,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:38,918 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 00:06:38,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:39,059 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 00:06:39,059 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:39,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839376774] [2021-11-06 00:06:39,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839376774] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:39,060 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:39,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:06:39,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836713210] [2021-11-06 00:06:39,060 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:39,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:06:39,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:39,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:06:39,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:06:39,061 INFO L87 Difference]: Start difference. First operand 1317 states and 1489 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:39,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:39,144 INFO L93 Difference]: Finished difference Result 1317 states and 1489 transitions. [2021-11-06 00:06:39,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:06:39,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-06 00:06:39,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:39,149 INFO L225 Difference]: With dead ends: 1317 [2021-11-06 00:06:39,149 INFO L226 Difference]: Without dead ends: 1313 [2021-11-06 00:06:39,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.92ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:06:39,150 INFO L933 BasicCegarLoop]: 1470 mSDtfsCounter, 1574 mSDsluCounter, 2672 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 4142 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.05ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.43ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:39,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1574 Valid, 4142 Invalid, 6 Unknown, 0 Unchecked, 4.05ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 9.43ms Time] [2021-11-06 00:06:39,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2021-11-06 00:06:39,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1313. [2021-11-06 00:06:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 1216 states have (on average 1.221217105263158) internal successors, (1485), 1312 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1485 transitions. [2021-11-06 00:06:39,225 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1485 transitions. Word has length 39 [2021-11-06 00:06:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:39,226 INFO L470 AbstractCegarLoop]: Abstraction has 1313 states and 1485 transitions. [2021-11-06 00:06:39,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1485 transitions. [2021-11-06 00:06:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 00:06:39,227 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:39,227 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:06:39,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-06 00:06:39,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:39,445 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:39,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:39,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1640398740, now seen corresponding path program 1 times [2021-11-06 00:06:39,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:39,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147098450] [2021-11-06 00:06:39,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:39,446 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:39,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:39,447 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:39,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-06 00:06:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:39,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:06:39,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:40,072 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 00:06:40,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:40,229 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 00:06:40,229 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:40,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147098450] [2021-11-06 00:06:40,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147098450] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:40,230 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:40,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:06:40,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578533756] [2021-11-06 00:06:40,230 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:40,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:06:40,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:40,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:06:40,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:06:40,231 INFO L87 Difference]: Start difference. First operand 1313 states and 1485 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:40,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:40,309 INFO L93 Difference]: Finished difference Result 1313 states and 1485 transitions. [2021-11-06 00:06:40,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:06:40,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-06 00:06:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:40,314 INFO L225 Difference]: With dead ends: 1313 [2021-11-06 00:06:40,314 INFO L226 Difference]: Without dead ends: 1309 [2021-11-06 00:06:40,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.90ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:06:40,316 INFO L933 BasicCegarLoop]: 1466 mSDtfsCounter, 1688 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 2806 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.32ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.80ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:40,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1688 Valid, 2806 Invalid, 7 Unknown, 0 Unchecked, 3.32ms Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 8.80ms Time] [2021-11-06 00:06:40,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2021-11-06 00:06:40,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1309. [2021-11-06 00:06:40,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1309 states, 1214 states have (on average 1.2199341021416803) internal successors, (1481), 1308 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1481 transitions. [2021-11-06 00:06:40,378 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1481 transitions. Word has length 41 [2021-11-06 00:06:40,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:40,378 INFO L470 AbstractCegarLoop]: Abstraction has 1309 states and 1481 transitions. [2021-11-06 00:06:40,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1481 transitions. [2021-11-06 00:06:40,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-06 00:06:40,380 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:40,380 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:06:40,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-06 00:06:40,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:40,602 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:40,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:40,602 INFO L85 PathProgramCache]: Analyzing trace with hash 170341880, now seen corresponding path program 1 times [2021-11-06 00:06:40,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:40,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500039870] [2021-11-06 00:06:40,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:40,603 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:40,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:40,604 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:40,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-06 00:06:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:41,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:06:41,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:41,232 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 00:06:41,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:41,361 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 00:06:41,361 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:41,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500039870] [2021-11-06 00:06:41,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500039870] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:41,362 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:41,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:06:41,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889897303] [2021-11-06 00:06:41,362 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:41,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:06:41,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:41,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:06:41,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:06:41,363 INFO L87 Difference]: Start difference. First operand 1309 states and 1481 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:41,464 INFO L93 Difference]: Finished difference Result 1309 states and 1481 transitions. [2021-11-06 00:06:41,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:06:41,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-06 00:06:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:41,470 INFO L225 Difference]: With dead ends: 1309 [2021-11-06 00:06:41,470 INFO L226 Difference]: Without dead ends: 1305 [2021-11-06 00:06:41,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.26ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:06:41,471 INFO L933 BasicCegarLoop]: 1462 mSDtfsCounter, 1666 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1666 SdHoareTripleChecker+Valid, 2806 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.30ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.26ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:41,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1666 Valid, 2806 Invalid, 7 Unknown, 0 Unchecked, 3.30ms Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 9.26ms Time] [2021-11-06 00:06:41,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2021-11-06 00:06:41,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1305. [2021-11-06 00:06:41,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 1212 states have (on average 1.2186468646864685) internal successors, (1477), 1304 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1477 transitions. [2021-11-06 00:06:41,531 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1477 transitions. Word has length 43 [2021-11-06 00:06:41,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:41,532 INFO L470 AbstractCegarLoop]: Abstraction has 1305 states and 1477 transitions. [2021-11-06 00:06:41,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:41,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1477 transitions. [2021-11-06 00:06:41,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-06 00:06:41,533 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:41,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:06:41,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-06 00:06:41,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:41,750 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:41,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:41,750 INFO L85 PathProgramCache]: Analyzing trace with hash 489940156, now seen corresponding path program 1 times [2021-11-06 00:06:41,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:41,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735348970] [2021-11-06 00:06:41,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:41,751 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:41,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:41,752 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:41,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-06 00:06:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:42,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:06:42,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:42,353 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 00:06:42,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:42,510 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 00:06:42,510 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:42,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735348970] [2021-11-06 00:06:42,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735348970] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:42,510 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:42,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:06:42,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117494065] [2021-11-06 00:06:42,510 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:42,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:06:42,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:42,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:06:42,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:06:42,512 INFO L87 Difference]: Start difference. First operand 1305 states and 1477 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:42,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:42,594 INFO L93 Difference]: Finished difference Result 1305 states and 1477 transitions. [2021-11-06 00:06:42,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:06:42,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-06 00:06:42,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:42,599 INFO L225 Difference]: With dead ends: 1305 [2021-11-06 00:06:42,599 INFO L226 Difference]: Without dead ends: 1301 [2021-11-06 00:06:42,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.30ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:06:42,600 INFO L933 BasicCegarLoop]: 1458 mSDtfsCounter, 1644 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 2806 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.42ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.01ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:42,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1644 Valid, 2806 Invalid, 7 Unknown, 0 Unchecked, 3.42ms Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 9.01ms Time] [2021-11-06 00:06:42,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2021-11-06 00:06:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1301. [2021-11-06 00:06:42,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1301 states, 1210 states have (on average 1.2173553719008265) internal successors, (1473), 1300 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 1473 transitions. [2021-11-06 00:06:42,663 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 1473 transitions. Word has length 45 [2021-11-06 00:06:42,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:42,663 INFO L470 AbstractCegarLoop]: Abstraction has 1301 states and 1473 transitions. [2021-11-06 00:06:42,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:42,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1473 transitions. [2021-11-06 00:06:42,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-06 00:06:42,664 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:42,664 INFO L514 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 00:06:42,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-06 00:06:42,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:42,880 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:42,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:42,881 INFO L85 PathProgramCache]: Analyzing trace with hash -246411345, now seen corresponding path program 1 times [2021-11-06 00:06:42,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:42,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187593398] [2021-11-06 00:06:42,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:42,882 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:42,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:42,883 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:42,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-06 00:06:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:43,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:06:43,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:43,578 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 00:06:43,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:43,722 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 00:06:43,722 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:43,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187593398] [2021-11-06 00:06:43,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187593398] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:43,722 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:43,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:06:43,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60453657] [2021-11-06 00:06:43,723 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:43,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:06:43,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:43,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:06:43,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:06:43,724 INFO L87 Difference]: Start difference. First operand 1301 states and 1473 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 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 00:06:44,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:44,084 INFO L93 Difference]: Finished difference Result 2782 states and 3145 transitions. [2021-11-06 00:06:44,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 00:06:44,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 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 46 [2021-11-06 00:06:44,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:44,095 INFO L225 Difference]: With dead ends: 2782 [2021-11-06 00:06:44,095 INFO L226 Difference]: Without dead ends: 2776 [2021-11-06 00:06:44,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 32.31ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-06 00:06:44,096 INFO L933 BasicCegarLoop]: 2309 mSDtfsCounter, 4165 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 155.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4165 SdHoareTripleChecker+Valid, 4783 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.87ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 181.90ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:44,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4165 Valid, 4783 Invalid, 76 Unknown, 0 Unchecked, 6.87ms Time], IncrementalHoareTripleChecker [19 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 181.90ms Time] [2021-11-06 00:06:44,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2021-11-06 00:06:44,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 1295. [2021-11-06 00:06:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 1207 states have (on average 1.2154101077050539) internal successors, (1467), 1294 states have internal predecessors, (1467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1467 transitions. [2021-11-06 00:06:44,182 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1467 transitions. Word has length 46 [2021-11-06 00:06:44,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:44,182 INFO L470 AbstractCegarLoop]: Abstraction has 1295 states and 1467 transitions. [2021-11-06 00:06:44,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 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 00:06:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1467 transitions. [2021-11-06 00:06:44,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 00:06:44,183 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:44,183 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:06:44,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-06 00:06:44,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:44,402 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:44,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:44,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1613761568, now seen corresponding path program 1 times [2021-11-06 00:06:44,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:44,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621088087] [2021-11-06 00:06:44,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:44,404 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:44,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:44,405 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:44,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-06 00:06:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:44,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:06:44,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:45,040 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 00:06:45,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:45,170 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 00:06:45,171 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:45,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621088087] [2021-11-06 00:06:45,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621088087] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:45,171 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:45,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:06:45,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546163084] [2021-11-06 00:06:45,171 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:45,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:06:45,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:45,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:06:45,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:06:45,172 INFO L87 Difference]: Start difference. First operand 1295 states and 1467 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:45,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:45,263 INFO L93 Difference]: Finished difference Result 1295 states and 1467 transitions. [2021-11-06 00:06:45,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:06:45,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-06 00:06:45,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:45,268 INFO L225 Difference]: With dead ends: 1295 [2021-11-06 00:06:45,268 INFO L226 Difference]: Without dead ends: 1291 [2021-11-06 00:06:45,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.97ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:06:45,269 INFO L933 BasicCegarLoop]: 1448 mSDtfsCounter, 1616 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1616 SdHoareTripleChecker+Valid, 2794 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.89ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.39ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:45,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1616 Valid, 2794 Invalid, 7 Unknown, 0 Unchecked, 2.89ms Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 7.39ms Time] [2021-11-06 00:06:45,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2021-11-06 00:06:45,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2021-11-06 00:06:45,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1205 states have (on average 1.2141078838174273) internal successors, (1463), 1290 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:45,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1463 transitions. [2021-11-06 00:06:45,350 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1463 transitions. Word has length 47 [2021-11-06 00:06:45,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:45,351 INFO L470 AbstractCegarLoop]: Abstraction has 1291 states and 1463 transitions. [2021-11-06 00:06:45,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:45,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1463 transitions. [2021-11-06 00:06:45,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-06 00:06:45,351 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:45,352 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:06:45,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-06 00:06:45,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:45,570 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:45,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:45,570 INFO L85 PathProgramCache]: Analyzing trace with hash -341522557, now seen corresponding path program 1 times [2021-11-06 00:06:45,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:45,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200366090] [2021-11-06 00:06:45,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:45,571 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:45,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:45,572 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:45,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-06 00:06:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:46,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:06:46,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:06:46,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:46,285 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 00:06:46,285 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:46,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200366090] [2021-11-06 00:06:46,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200366090] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:46,285 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:46,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:06:46,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123158256] [2021-11-06 00:06:46,285 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:46,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:06:46,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:46,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:06:46,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:06:46,286 INFO L87 Difference]: Start difference. First operand 1291 states and 1463 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:46,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:46,375 INFO L93 Difference]: Finished difference Result 1291 states and 1463 transitions. [2021-11-06 00:06:46,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:06:46,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-11-06 00:06:46,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:46,378 INFO L225 Difference]: With dead ends: 1291 [2021-11-06 00:06:46,378 INFO L226 Difference]: Without dead ends: 1287 [2021-11-06 00:06:46,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.18ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:06:46,379 INFO L933 BasicCegarLoop]: 1444 mSDtfsCounter, 1594 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 2794 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.36ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.80ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:46,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1594 Valid, 2794 Invalid, 7 Unknown, 0 Unchecked, 2.36ms Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 8.80ms Time] [2021-11-06 00:06:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2021-11-06 00:06:46,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1287. [2021-11-06 00:06:46,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1203 states have (on average 1.2128013300083125) internal successors, (1459), 1286 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1459 transitions. [2021-11-06 00:06:46,457 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1459 transitions. Word has length 49 [2021-11-06 00:06:46,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:46,457 INFO L470 AbstractCegarLoop]: Abstraction has 1287 states and 1459 transitions. [2021-11-06 00:06:46,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:46,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1459 transitions. [2021-11-06 00:06:46,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 00:06:46,458 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:46,458 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:06:46,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-06 00:06:46,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:46,666 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:46,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:46,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1785511033, now seen corresponding path program 1 times [2021-11-06 00:06:46,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:46,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718827943] [2021-11-06 00:06:46,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:46,668 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:46,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:46,669 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:46,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-06 00:06:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:47,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:06:47,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:47,252 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 00:06:47,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:47,380 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 00:06:47,380 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:47,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718827943] [2021-11-06 00:06:47,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718827943] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:47,381 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:47,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:06:47,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530018043] [2021-11-06 00:06:47,381 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:47,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:06:47,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:47,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:06:47,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:06:47,384 INFO L87 Difference]: Start difference. First operand 1287 states and 1459 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:47,506 INFO L93 Difference]: Finished difference Result 1958 states and 2224 transitions. [2021-11-06 00:06:47,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 00:06:47,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-06 00:06:47,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:47,511 INFO L225 Difference]: With dead ends: 1958 [2021-11-06 00:06:47,511 INFO L226 Difference]: Without dead ends: 1954 [2021-11-06 00:06:47,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.65ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:06:47,512 INFO L933 BasicCegarLoop]: 1441 mSDtfsCounter, 1614 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1614 SdHoareTripleChecker+Valid, 3601 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.57ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.31ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:47,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1614 Valid, 3601 Invalid, 15 Unknown, 0 Unchecked, 2.57ms Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 15.31ms Time] [2021-11-06 00:06:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2021-11-06 00:06:47,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1822. [2021-11-06 00:06:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1739 states have (on average 1.2265669925244393) internal successors, (2133), 1821 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:47,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2133 transitions. [2021-11-06 00:06:47,632 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2133 transitions. Word has length 51 [2021-11-06 00:06:47,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:47,632 INFO L470 AbstractCegarLoop]: Abstraction has 1822 states and 2133 transitions. [2021-11-06 00:06:47,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2133 transitions. [2021-11-06 00:06:47,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 00:06:47,633 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:47,633 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:06:47,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-06 00:06:47,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:47,835 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:47,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:47,836 INFO L85 PathProgramCache]: Analyzing trace with hash 54559857, now seen corresponding path program 1 times [2021-11-06 00:06:47,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:47,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511821635] [2021-11-06 00:06:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:47,837 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:47,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:47,838 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:47,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-06 00:06:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:48,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 00:06:48,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:48,447 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 00:06:48,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:48,505 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 00:06:48,505 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:48,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511821635] [2021-11-06 00:06:48,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511821635] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:48,506 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:48,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:06:48,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196427173] [2021-11-06 00:06:48,506 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:48,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:06:48,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:48,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:06:48,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:06:48,506 INFO L87 Difference]: Start difference. First operand 1822 states and 2133 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:48,644 INFO L93 Difference]: Finished difference Result 3755 states and 4399 transitions. [2021-11-06 00:06:48,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:06:48,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-06 00:06:48,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:48,650 INFO L225 Difference]: With dead ends: 3755 [2021-11-06 00:06:48,650 INFO L226 Difference]: Without dead ends: 1951 [2021-11-06 00:06:48,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.51ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:06:48,653 INFO L933 BasicCegarLoop]: 1443 mSDtfsCounter, 298 mSDsluCounter, 2733 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 4176 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.85ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.36ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:48,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 4176 Invalid, 13 Unknown, 0 Unchecked, 1.85ms Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 31.36ms Time] [2021-11-06 00:06:48,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2021-11-06 00:06:48,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1923. [2021-11-06 00:06:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1840 states have (on average 1.233695652173913) internal successors, (2270), 1922 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2270 transitions. [2021-11-06 00:06:48,790 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2270 transitions. Word has length 53 [2021-11-06 00:06:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:48,790 INFO L470 AbstractCegarLoop]: Abstraction has 1923 states and 2270 transitions. [2021-11-06 00:06:48,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2270 transitions. [2021-11-06 00:06:48,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 00:06:48,799 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:48,799 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:06:48,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-06 00:06:49,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:49,020 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:49,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:49,020 INFO L85 PathProgramCache]: Analyzing trace with hash 2110967787, now seen corresponding path program 1 times [2021-11-06 00:06:49,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:49,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343506755] [2021-11-06 00:06:49,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:49,021 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:49,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:49,022 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:49,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-06 00:06:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:49,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:06:49,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:49,657 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 00:06:49,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:49,835 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 00:06:49,835 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:49,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343506755] [2021-11-06 00:06:49,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1343506755] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:49,836 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:49,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:06:49,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182603940] [2021-11-06 00:06:49,836 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:49,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:06:49,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:49,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:06:49,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:06:49,837 INFO L87 Difference]: Start difference. First operand 1923 states and 2270 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:50,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:50,043 INFO L93 Difference]: Finished difference Result 2366 states and 2759 transitions. [2021-11-06 00:06:50,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 00:06:50,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-06 00:06:50,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:50,050 INFO L225 Difference]: With dead ends: 2366 [2021-11-06 00:06:50,050 INFO L226 Difference]: Without dead ends: 2362 [2021-11-06 00:06:50,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.69ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:06:50,051 INFO L933 BasicCegarLoop]: 1432 mSDtfsCounter, 880 mSDsluCounter, 3849 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 79.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 5281 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.64ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 89.63ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:50,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [880 Valid, 5281 Invalid, 49 Unknown, 0 Unchecked, 2.64ms Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 89.63ms Time] [2021-11-06 00:06:50,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2021-11-06 00:06:50,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2292. [2021-11-06 00:06:50,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2292 states, 2210 states have (on average 1.218099547511312) internal successors, (2692), 2291 states have internal predecessors, (2692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 2692 transitions. [2021-11-06 00:06:50,223 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 2692 transitions. Word has length 53 [2021-11-06 00:06:50,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:50,223 INFO L470 AbstractCegarLoop]: Abstraction has 2292 states and 2692 transitions. [2021-11-06 00:06:50,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:50,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 2692 transitions. [2021-11-06 00:06:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-06 00:06:50,224 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:50,224 INFO L514 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 00:06:50,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-11-06 00:06:50,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:50,439 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:50,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:50,440 INFO L85 PathProgramCache]: Analyzing trace with hash 377020572, now seen corresponding path program 1 times [2021-11-06 00:06:50,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:50,440 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311320172] [2021-11-06 00:06:50,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:50,441 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:50,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:50,442 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:50,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-06 00:06:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:50,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:06:50,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:51,019 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 00:06:51,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:51,096 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 00:06:51,097 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:51,097 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311320172] [2021-11-06 00:06:51,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311320172] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:51,097 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:51,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 00:06:51,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350488634] [2021-11-06 00:06:51,097 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:51,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:06:51,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:51,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:06:51,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:06:51,098 INFO L87 Difference]: Start difference. First operand 2292 states and 2692 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:51,570 INFO L93 Difference]: Finished difference Result 5582 states and 6569 transitions. [2021-11-06 00:06:51,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:06:51,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-06 00:06:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:51,580 INFO L225 Difference]: With dead ends: 5582 [2021-11-06 00:06:51,580 INFO L226 Difference]: Without dead ends: 3693 [2021-11-06 00:06:51,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.80ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:06:51,583 INFO L933 BasicCegarLoop]: 1513 mSDtfsCounter, 2050 mSDsluCounter, 2784 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 224.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2050 SdHoareTripleChecker+Valid, 4297 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.83ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 259.79ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:51,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2050 Valid, 4297 Invalid, 177 Unknown, 0 Unchecked, 3.83ms Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 259.79ms Time] [2021-11-06 00:06:51,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3693 states. [2021-11-06 00:06:51,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3693 to 2229. [2021-11-06 00:06:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 2147 states have (on average 1.2193758733115976) internal successors, (2618), 2228 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 2618 transitions. [2021-11-06 00:06:51,797 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 2618 transitions. Word has length 54 [2021-11-06 00:06:51,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:51,798 INFO L470 AbstractCegarLoop]: Abstraction has 2229 states and 2618 transitions. [2021-11-06 00:06:51,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:51,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2618 transitions. [2021-11-06 00:06:51,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 00:06:51,798 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:51,799 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:06:51,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-06 00:06:52,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:52,005 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:52,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:52,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1415632047, now seen corresponding path program 1 times [2021-11-06 00:06:52,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:52,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966515221] [2021-11-06 00:06:52,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:52,007 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:52,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:52,008 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:52,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-06 00:06:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:52,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:06:52,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:52,621 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 00:06:52,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:52,759 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 00:06:52,759 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:52,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966515221] [2021-11-06 00:06:52,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966515221] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:52,760 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:52,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:06:52,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266556840] [2021-11-06 00:06:52,760 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:52,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:06:52,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:52,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:06:52,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:06:52,761 INFO L87 Difference]: Start difference. First operand 2229 states and 2618 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:52,936 INFO L93 Difference]: Finished difference Result 2229 states and 2618 transitions. [2021-11-06 00:06:52,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:06:52,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-06 00:06:52,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:52,941 INFO L225 Difference]: With dead ends: 2229 [2021-11-06 00:06:52,941 INFO L226 Difference]: Without dead ends: 2225 [2021-11-06 00:06:52,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.15ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:06:52,942 INFO L933 BasicCegarLoop]: 1427 mSDtfsCounter, 1460 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1460 SdHoareTripleChecker+Valid, 4141 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.72ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.78ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:52,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1460 Valid, 4141 Invalid, 33 Unknown, 0 Unchecked, 2.72ms Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 32.78ms Time] [2021-11-06 00:06:52,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2225 states. [2021-11-06 00:06:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2225 to 2225. [2021-11-06 00:06:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 2145 states have (on average 1.2186480186480186) internal successors, (2614), 2224 states have internal predecessors, (2614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 2614 transitions. [2021-11-06 00:06:53,077 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 2614 transitions. Word has length 55 [2021-11-06 00:06:53,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:53,078 INFO L470 AbstractCegarLoop]: Abstraction has 2225 states and 2614 transitions. [2021-11-06 00:06:53,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:53,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2614 transitions. [2021-11-06 00:06:53,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 00:06:53,078 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:53,079 INFO L514 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 00:06:53,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-06 00:06:53,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:53,284 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:53,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:53,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1082082861, now seen corresponding path program 1 times [2021-11-06 00:06:53,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:53,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661053045] [2021-11-06 00:06:53,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:53,285 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:53,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:53,286 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:53,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-06 00:06:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:53,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:06:53,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:53,882 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 00:06:53,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:54,036 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 00:06:54,036 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:54,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661053045] [2021-11-06 00:06:54,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661053045] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:54,036 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:54,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:06:54,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181012741] [2021-11-06 00:06:54,036 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:54,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:06:54,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:54,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:06:54,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:06:54,037 INFO L87 Difference]: Start difference. First operand 2225 states and 2614 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:54,373 INFO L93 Difference]: Finished difference Result 2967 states and 3434 transitions. [2021-11-06 00:06:54,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 00:06:54,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-06 00:06:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:54,378 INFO L225 Difference]: With dead ends: 2967 [2021-11-06 00:06:54,378 INFO L226 Difference]: Without dead ends: 2963 [2021-11-06 00:06:54,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.05ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:06:54,380 INFO L933 BasicCegarLoop]: 1429 mSDtfsCounter, 614 mSDsluCounter, 4180 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 132.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 5609 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.81ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 151.03ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:54,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [614 Valid, 5609 Invalid, 71 Unknown, 0 Unchecked, 2.81ms Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 151.03ms Time] [2021-11-06 00:06:54,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2021-11-06 00:06:54,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2867. [2021-11-06 00:06:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2867 states, 2787 states have (on average 1.1998564764980266) internal successors, (3344), 2866 states have internal predecessors, (3344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2867 states to 2867 states and 3344 transitions. [2021-11-06 00:06:54,610 INFO L78 Accepts]: Start accepts. Automaton has 2867 states and 3344 transitions. Word has length 57 [2021-11-06 00:06:54,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:54,610 INFO L470 AbstractCegarLoop]: Abstraction has 2867 states and 3344 transitions. [2021-11-06 00:06:54,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:54,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2867 states and 3344 transitions. [2021-11-06 00:06:54,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 00:06:54,611 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:54,611 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:06:54,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-11-06 00:06:54,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:54,812 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:54,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:54,812 INFO L85 PathProgramCache]: Analyzing trace with hash 17777306, now seen corresponding path program 1 times [2021-11-06 00:06:54,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:54,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299229378] [2021-11-06 00:06:54,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:54,813 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:54,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:54,814 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:54,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-06 00:06:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:55,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:06:55,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:55,600 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 00:06:55,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:55,748 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 00:06:55,748 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:55,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299229378] [2021-11-06 00:06:55,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299229378] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:55,748 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:55,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:06:55,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353753970] [2021-11-06 00:06:55,748 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:55,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:06:55,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:55,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:06:55,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:06:55,750 INFO L87 Difference]: Start difference. First operand 2867 states and 3344 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:56,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:56,320 INFO L93 Difference]: Finished difference Result 5645 states and 6551 transitions. [2021-11-06 00:06:56,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 00:06:56,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-06 00:06:56,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:56,328 INFO L225 Difference]: With dead ends: 5645 [2021-11-06 00:06:56,328 INFO L226 Difference]: Without dead ends: 5637 [2021-11-06 00:06:56,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.06ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:06:56,329 INFO L933 BasicCegarLoop]: 2998 mSDtfsCounter, 3890 mSDsluCounter, 4407 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 157.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3890 SdHoareTripleChecker+Valid, 7405 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.85ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 181.05ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:56,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3890 Valid, 7405 Invalid, 100 Unknown, 0 Unchecked, 5.85ms Time], IncrementalHoareTripleChecker [20 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 181.05ms Time] [2021-11-06 00:06:56,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5637 states. [2021-11-06 00:06:56,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5637 to 2861. [2021-11-06 00:06:56,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2784 states have (on average 1.197198275862069) internal successors, (3333), 2860 states have internal predecessors, (3333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 3333 transitions. [2021-11-06 00:06:56,513 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 3333 transitions. Word has length 59 [2021-11-06 00:06:56,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:56,514 INFO L470 AbstractCegarLoop]: Abstraction has 2861 states and 3333 transitions. [2021-11-06 00:06:56,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:56,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 3333 transitions. [2021-11-06 00:06:56,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 00:06:56,514 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:56,514 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:06:56,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-11-06 00:06:56,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:56,719 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:56,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:56,720 INFO L85 PathProgramCache]: Analyzing trace with hash -499390633, now seen corresponding path program 1 times [2021-11-06 00:06:56,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:56,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321260953] [2021-11-06 00:06:56,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:56,721 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:56,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:56,722 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:56,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-11-06 00:06:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:57,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:06:57,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:57,328 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 00:06:57,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:57,476 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 00:06:57,476 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:57,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321260953] [2021-11-06 00:06:57,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321260953] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:57,476 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:57,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:06:57,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897272197] [2021-11-06 00:06:57,477 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:57,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:06:57,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:57,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:06:57,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:06:57,478 INFO L87 Difference]: Start difference. First operand 2861 states and 3333 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:57,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:57,706 INFO L93 Difference]: Finished difference Result 2861 states and 3333 transitions. [2021-11-06 00:06:57,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:06:57,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-06 00:06:57,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:57,710 INFO L225 Difference]: With dead ends: 2861 [2021-11-06 00:06:57,710 INFO L226 Difference]: Without dead ends: 2857 [2021-11-06 00:06:57,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.87ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:06:57,711 INFO L933 BasicCegarLoop]: 1417 mSDtfsCounter, 1430 mSDsluCounter, 2726 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1430 SdHoareTripleChecker+Valid, 4143 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.52ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.23ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:57,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1430 Valid, 4143 Invalid, 33 Unknown, 0 Unchecked, 2.52ms Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 41.23ms Time] [2021-11-06 00:06:57,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2021-11-06 00:06:57,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2857. [2021-11-06 00:06:57,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2857 states, 2782 states have (on average 1.1966211358734724) internal successors, (3329), 2856 states have internal predecessors, (3329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:57,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 3329 transitions. [2021-11-06 00:06:57,902 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 3329 transitions. Word has length 59 [2021-11-06 00:06:57,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:57,902 INFO L470 AbstractCegarLoop]: Abstraction has 2857 states and 3329 transitions. [2021-11-06 00:06:57,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:57,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3329 transitions. [2021-11-06 00:06:57,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 00:06:57,903 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:57,903 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:06:57,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2021-11-06 00:06:58,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:06:58,103 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:06:58,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:06:58,104 INFO L85 PathProgramCache]: Analyzing trace with hash -95745666, now seen corresponding path program 1 times [2021-11-06 00:06:58,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:06:58,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799977125] [2021-11-06 00:06:58,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:06:58,105 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:06:58,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:06:58,107 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:06:58,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-11-06 00:06:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:06:58,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:06:58,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:06:58,952 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 00:06:58,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:06:59,104 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 00:06:59,104 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:06:59,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799977125] [2021-11-06 00:06:59,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799977125] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:06:59,104 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:06:59,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:06:59,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263258314] [2021-11-06 00:06:59,105 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:06:59,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:06:59,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:06:59,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:06:59,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:06:59,105 INFO L87 Difference]: Start difference. First operand 2857 states and 3329 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:59,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:06:59,527 INFO L93 Difference]: Finished difference Result 4639 states and 5385 transitions. [2021-11-06 00:06:59,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:06:59,528 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-06 00:06:59,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:06:59,535 INFO L225 Difference]: With dead ends: 4639 [2021-11-06 00:06:59,535 INFO L226 Difference]: Without dead ends: 4621 [2021-11-06 00:06:59,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.20ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:06:59,537 INFO L933 BasicCegarLoop]: 2485 mSDtfsCounter, 2733 mSDsluCounter, 2226 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2733 SdHoareTripleChecker+Valid, 4711 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.38ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.07ms IncrementalHoareTripleChecker+Time [2021-11-06 00:06:59,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2733 Valid, 4711 Invalid, 51 Unknown, 0 Unchecked, 4.38ms Time], IncrementalHoareTripleChecker [20 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 56.07ms Time] [2021-11-06 00:06:59,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4621 states. [2021-11-06 00:06:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4621 to 2839. [2021-11-06 00:06:59,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2839 states, 2773 states have (on average 1.1896862603678326) internal successors, (3299), 2838 states have internal predecessors, (3299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 3299 transitions. [2021-11-06 00:06:59,808 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 3299 transitions. Word has length 61 [2021-11-06 00:06:59,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:06:59,808 INFO L470 AbstractCegarLoop]: Abstraction has 2839 states and 3299 transitions. [2021-11-06 00:06:59,808 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:06:59,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 3299 transitions. [2021-11-06 00:06:59,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 00:06:59,809 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:06:59,809 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:06:59,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-11-06 00:07:00,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:07:00,023 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:07:00,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:07:00,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1122092347, now seen corresponding path program 1 times [2021-11-06 00:07:00,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:07:00,024 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176018513] [2021-11-06 00:07:00,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:07:00,025 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:07:00,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:07:00,026 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:07:00,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-11-06 00:07:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:07:00,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:07:00,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:07:00,637 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 00:07:00,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:07:00,991 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 00:07:00,991 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:07:00,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176018513] [2021-11-06 00:07:00,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176018513] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:07:00,991 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:07:00,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-06 00:07:00,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479850974] [2021-11-06 00:07:00,991 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:07:00,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 00:07:00,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:07:00,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 00:07:00,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:07:00,992 INFO L87 Difference]: Start difference. First operand 2839 states and 3299 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:07:01,205 INFO L93 Difference]: Finished difference Result 2839 states and 3299 transitions. [2021-11-06 00:07:01,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:07:01,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-06 00:07:01,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:07:01,210 INFO L225 Difference]: With dead ends: 2839 [2021-11-06 00:07:01,211 INFO L226 Difference]: Without dead ends: 2835 [2021-11-06 00:07:01,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 25.72ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 00:07:01,212 INFO L933 BasicCegarLoop]: 1404 mSDtfsCounter, 1398 mSDsluCounter, 2716 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 4120 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.47ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.23ms IncrementalHoareTripleChecker+Time [2021-11-06 00:07:01,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1398 Valid, 4120 Invalid, 6 Unknown, 0 Unchecked, 2.47ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 6.23ms Time] [2021-11-06 00:07:01,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2021-11-06 00:07:01,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2835. [2021-11-06 00:07:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2835 states, 2771 states have (on average 1.1891014074341393) internal successors, (3295), 2834 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:01,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2835 states and 3295 transitions. [2021-11-06 00:07:01,434 INFO L78 Accepts]: Start accepts. Automaton has 2835 states and 3295 transitions. Word has length 61 [2021-11-06 00:07:01,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:07:01,434 INFO L470 AbstractCegarLoop]: Abstraction has 2835 states and 3295 transitions. [2021-11-06 00:07:01,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 3295 transitions. [2021-11-06 00:07:01,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-06 00:07:01,435 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:07:01,436 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:07:01,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-11-06 00:07:01,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:07:01,636 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:07:01,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:07:01,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1634040879, now seen corresponding path program 1 times [2021-11-06 00:07:01,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:07:01,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681864868] [2021-11-06 00:07:01,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:07:01,638 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:07:01,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:07:01,639 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:07:01,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-11-06 00:07:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:07:02,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:07:02,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:07:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:07:02,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:07:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:07:02,410 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:07:02,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681864868] [2021-11-06 00:07:02,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681864868] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:07:02,410 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:07:02,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-06 00:07:02,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650690139] [2021-11-06 00:07:02,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:07:02,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 00:07:02,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:07:02,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 00:07:02,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 00:07:02,411 INFO L87 Difference]: Start difference. First operand 2835 states and 3295 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:07:02,780 INFO L93 Difference]: Finished difference Result 5490 states and 6407 transitions. [2021-11-06 00:07:02,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 00:07:02,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-06 00:07:02,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:07:02,787 INFO L225 Difference]: With dead ends: 5490 [2021-11-06 00:07:02,788 INFO L226 Difference]: Without dead ends: 3315 [2021-11-06 00:07:02,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 72.96ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-11-06 00:07:02,792 INFO L933 BasicCegarLoop]: 1675 mSDtfsCounter, 2422 mSDsluCounter, 4881 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 80.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2422 SdHoareTripleChecker+Valid, 6556 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.25ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 90.02ms IncrementalHoareTripleChecker+Time [2021-11-06 00:07:02,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2422 Valid, 6556 Invalid, 49 Unknown, 0 Unchecked, 3.25ms Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 90.02ms Time] [2021-11-06 00:07:02,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states. [2021-11-06 00:07:03,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 3235. [2021-11-06 00:07:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3235 states, 3171 states have (on average 1.2030905077262692) internal successors, (3815), 3234 states have internal predecessors, (3815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3235 states to 3235 states and 3815 transitions. [2021-11-06 00:07:03,120 INFO L78 Accepts]: Start accepts. Automaton has 3235 states and 3815 transitions. Word has length 63 [2021-11-06 00:07:03,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:07:03,120 INFO L470 AbstractCegarLoop]: Abstraction has 3235 states and 3815 transitions. [2021-11-06 00:07:03,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3235 states and 3815 transitions. [2021-11-06 00:07:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-06 00:07:03,121 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:07:03,121 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:07:03,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-11-06 00:07:03,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:07:03,335 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:07:03,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:07:03,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1817139006, now seen corresponding path program 1 times [2021-11-06 00:07:03,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:07:03,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270788918] [2021-11-06 00:07:03,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:07:03,337 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:07:03,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:07:03,338 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:07:03,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-11-06 00:07:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:07:03,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-06 00:07:03,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:07:04,064 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 00:07:04,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:07:04,249 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 00:07:04,249 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:07:04,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270788918] [2021-11-06 00:07:04,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270788918] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:07:04,250 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:07:04,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 00:07:04,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804845080] [2021-11-06 00:07:04,250 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:07:04,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 00:07:04,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:07:04,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 00:07:04,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:07:04,251 INFO L87 Difference]: Start difference. First operand 3235 states and 3815 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:06,298 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:07:07,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:07:07,092 INFO L93 Difference]: Finished difference Result 5091 states and 5961 transitions. [2021-11-06 00:07:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 00:07:07,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-06 00:07:07,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:07:07,101 INFO L225 Difference]: With dead ends: 5091 [2021-11-06 00:07:07,101 INFO L226 Difference]: Without dead ends: 5073 [2021-11-06 00:07:07,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 32.29ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-06 00:07:07,103 INFO L933 BasicCegarLoop]: 2427 mSDtfsCounter, 4008 mSDsluCounter, 3524 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 68 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2354.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4008 SdHoareTripleChecker+Valid, 5951 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.11ms SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2433.24ms IncrementalHoareTripleChecker+Time [2021-11-06 00:07:07,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4008 Valid, 5951 Invalid, 230 Unknown, 0 Unchecked, 6.11ms Time], IncrementalHoareTripleChecker [68 Valid, 161 Invalid, 1 Unknown, 0 Unchecked, 2433.24ms Time] [2021-11-06 00:07:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5073 states. [2021-11-06 00:07:07,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5073 to 3217. [2021-11-06 00:07:07,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3217 states, 3162 states have (on average 1.1932321315623022) internal successors, (3773), 3216 states have internal predecessors, (3773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 3773 transitions. [2021-11-06 00:07:07,462 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 3773 transitions. Word has length 63 [2021-11-06 00:07:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:07:07,462 INFO L470 AbstractCegarLoop]: Abstraction has 3217 states and 3773 transitions. [2021-11-06 00:07:07,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:07,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 3773 transitions. [2021-11-06 00:07:07,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-06 00:07:07,464 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:07:07,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:07:07,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-11-06 00:07:07,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:07:07,679 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:07:07,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:07:07,680 INFO L85 PathProgramCache]: Analyzing trace with hash 294108031, now seen corresponding path program 1 times [2021-11-06 00:07:07,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:07:07,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324078690] [2021-11-06 00:07:07,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:07:07,681 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:07:07,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:07:07,682 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:07:07,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-11-06 00:07:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:07:08,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:07:08,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:07:08,341 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 00:07:08,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:07:08,505 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 00:07:08,505 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:07:08,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324078690] [2021-11-06 00:07:08,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324078690] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:07:08,505 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:07:08,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:07:08,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213353391] [2021-11-06 00:07:08,506 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:07:08,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:07:08,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:07:08,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:07:08,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:07:08,507 INFO L87 Difference]: Start difference. First operand 3217 states and 3773 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:08,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:07:08,745 INFO L93 Difference]: Finished difference Result 3217 states and 3773 transitions. [2021-11-06 00:07:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:07:08,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-06 00:07:08,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:07:08,749 INFO L225 Difference]: With dead ends: 3217 [2021-11-06 00:07:08,749 INFO L226 Difference]: Without dead ends: 3213 [2021-11-06 00:07:08,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.44ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:07:08,751 INFO L933 BasicCegarLoop]: 1382 mSDtfsCounter, 1366 mSDsluCounter, 2688 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1366 SdHoareTripleChecker+Valid, 4070 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.50ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.45ms IncrementalHoareTripleChecker+Time [2021-11-06 00:07:08,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1366 Valid, 4070 Invalid, 6 Unknown, 0 Unchecked, 2.50ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 6.45ms Time] [2021-11-06 00:07:08,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2021-11-06 00:07:08,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 3213. [2021-11-06 00:07:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3213 states, 3160 states have (on average 1.1927215189873417) internal successors, (3769), 3212 states have internal predecessors, (3769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3213 states to 3213 states and 3769 transitions. [2021-11-06 00:07:09,003 INFO L78 Accepts]: Start accepts. Automaton has 3213 states and 3769 transitions. Word has length 63 [2021-11-06 00:07:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:07:09,004 INFO L470 AbstractCegarLoop]: Abstraction has 3213 states and 3769 transitions. [2021-11-06 00:07:09,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 3213 states and 3769 transitions. [2021-11-06 00:07:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-06 00:07:09,004 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:07:09,005 INFO L514 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 00:07:09,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2021-11-06 00:07:09,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:07:09,207 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:07:09,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:07:09,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1781237862, now seen corresponding path program 1 times [2021-11-06 00:07:09,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:07:09,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613511817] [2021-11-06 00:07:09,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:07:09,208 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:07:09,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:07:09,209 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:07:09,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-11-06 00:07:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:07:09,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:07:09,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:07:09,934 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 00:07:09,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:07:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:07:10,098 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:07:10,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613511817] [2021-11-06 00:07:10,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [613511817] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:07:10,099 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:07:10,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:07:10,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3656489] [2021-11-06 00:07:10,099 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:07:10,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:07:10,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:07:10,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:07:10,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:07:10,100 INFO L87 Difference]: Start difference. First operand 3213 states and 3769 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:07:10,630 INFO L93 Difference]: Finished difference Result 5095 states and 5941 transitions. [2021-11-06 00:07:10,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:07:10,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-06 00:07:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:07:10,636 INFO L225 Difference]: With dead ends: 5095 [2021-11-06 00:07:10,636 INFO L226 Difference]: Without dead ends: 5077 [2021-11-06 00:07:10,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.73ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:07:10,637 INFO L933 BasicCegarLoop]: 2453 mSDtfsCounter, 3980 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3980 SdHoareTripleChecker+Valid, 3578 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.30ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.59ms IncrementalHoareTripleChecker+Time [2021-11-06 00:07:10,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3980 Valid, 3578 Invalid, 57 Unknown, 0 Unchecked, 4.30ms Time], IncrementalHoareTripleChecker [28 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 53.59ms Time] [2021-11-06 00:07:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5077 states. [2021-11-06 00:07:10,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5077 to 3195. [2021-11-06 00:07:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3195 states, 3151 states have (on average 1.1827991113932086) internal successors, (3727), 3194 states have internal predecessors, (3727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 3727 transitions. [2021-11-06 00:07:10,960 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 3727 transitions. Word has length 65 [2021-11-06 00:07:10,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:07:10,960 INFO L470 AbstractCegarLoop]: Abstraction has 3195 states and 3727 transitions. [2021-11-06 00:07:10,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 3727 transitions. [2021-11-06 00:07:10,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-06 00:07:10,961 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:07:10,961 INFO L514 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 00:07:10,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2021-11-06 00:07:11,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:07:11,171 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:07:11,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:07:11,172 INFO L85 PathProgramCache]: Analyzing trace with hash -829869533, now seen corresponding path program 1 times [2021-11-06 00:07:11,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:07:11,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056178589] [2021-11-06 00:07:11,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:07:11,173 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:07:11,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:07:11,173 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:07:11,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-11-06 00:07:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:07:11,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:07:11,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:07:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:07:11,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:07:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:07:11,964 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:07:11,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056178589] [2021-11-06 00:07:11,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056178589] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:07:11,964 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:07:11,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:07:11,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286736707] [2021-11-06 00:07:11,964 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:07:11,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:07:11,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:07:11,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:07:11,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:07:11,965 INFO L87 Difference]: Start difference. First operand 3195 states and 3727 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:12,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:07:12,224 INFO L93 Difference]: Finished difference Result 3195 states and 3727 transitions. [2021-11-06 00:07:12,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:07:12,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-06 00:07:12,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:07:12,227 INFO L225 Difference]: With dead ends: 3195 [2021-11-06 00:07:12,227 INFO L226 Difference]: Without dead ends: 3191 [2021-11-06 00:07:12,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.59ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:07:12,228 INFO L933 BasicCegarLoop]: 1360 mSDtfsCounter, 1366 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1366 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.11ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.68ms IncrementalHoareTripleChecker+Time [2021-11-06 00:07:12,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1366 Valid, 2690 Invalid, 7 Unknown, 0 Unchecked, 2.11ms Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 6.68ms Time] [2021-11-06 00:07:12,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3191 states. [2021-11-06 00:07:12,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3191 to 3191. [2021-11-06 00:07:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3191 states, 3149 states have (on average 1.1822800889171166) internal successors, (3723), 3190 states have internal predecessors, (3723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:12,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 3723 transitions. [2021-11-06 00:07:12,514 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 3723 transitions. Word has length 65 [2021-11-06 00:07:12,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:07:12,514 INFO L470 AbstractCegarLoop]: Abstraction has 3191 states and 3723 transitions. [2021-11-06 00:07:12,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:12,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 3723 transitions. [2021-11-06 00:07:12,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 00:07:12,515 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:07:12,515 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:07:12,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2021-11-06 00:07:12,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:07:12,716 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:07:12,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:07:12,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1922230228, now seen corresponding path program 1 times [2021-11-06 00:07:12,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:07:12,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240493746] [2021-11-06 00:07:12,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:07:12,717 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:07:12,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:07:12,718 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:07:12,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-11-06 00:07:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:07:13,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:07:13,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:07:13,445 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 00:07:13,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:07:13,617 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 00:07:13,617 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:07:13,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240493746] [2021-11-06 00:07:13,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240493746] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:07:13,617 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:07:13,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:07:13,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192241585] [2021-11-06 00:07:13,618 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:07:13,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:07:13,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:07:13,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:07:13,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:07:13,619 INFO L87 Difference]: Start difference. First operand 3191 states and 3723 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:14,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:07:14,319 INFO L93 Difference]: Finished difference Result 5430 states and 6262 transitions. [2021-11-06 00:07:14,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 00:07:14,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-06 00:07:14,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:07:14,326 INFO L225 Difference]: With dead ends: 5430 [2021-11-06 00:07:14,326 INFO L226 Difference]: Without dead ends: 5414 [2021-11-06 00:07:14,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.94ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-06 00:07:14,327 INFO L933 BasicCegarLoop]: 2665 mSDtfsCounter, 3096 mSDsluCounter, 2733 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 154.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3096 SdHoareTripleChecker+Valid, 5398 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.38ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 180.31ms IncrementalHoareTripleChecker+Time [2021-11-06 00:07:14,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3096 Valid, 5398 Invalid, 100 Unknown, 0 Unchecked, 5.38ms Time], IncrementalHoareTripleChecker [27 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 180.31ms Time] [2021-11-06 00:07:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5414 states. [2021-11-06 00:07:14,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5414 to 3175. [2021-11-06 00:07:14,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3175 states, 3141 states have (on average 1.1754218401782872) internal successors, (3692), 3174 states have internal predecessors, (3692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:14,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 3692 transitions. [2021-11-06 00:07:14,719 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 3692 transitions. Word has length 67 [2021-11-06 00:07:14,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:07:14,720 INFO L470 AbstractCegarLoop]: Abstraction has 3175 states and 3692 transitions. [2021-11-06 00:07:14,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:14,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 3692 transitions. [2021-11-06 00:07:14,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 00:07:14,721 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:07:14,721 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:07:14,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2021-11-06 00:07:14,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:07:14,938 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:07:14,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:07:14,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1359450407, now seen corresponding path program 1 times [2021-11-06 00:07:14,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:07:14,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766636621] [2021-11-06 00:07:14,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:07:14,939 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:07:14,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:07:14,940 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:07:14,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-11-06 00:07:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:07:15,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:07:15,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:07:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:07:15,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:07:15,729 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 00:07:15,730 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:07:15,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766636621] [2021-11-06 00:07:15,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766636621] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:07:15,730 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:07:15,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:07:15,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672528349] [2021-11-06 00:07:15,730 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:07:15,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:07:15,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:07:15,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:07:15,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:07:15,731 INFO L87 Difference]: Start difference. First operand 3175 states and 3692 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:07:16,031 INFO L93 Difference]: Finished difference Result 3175 states and 3692 transitions. [2021-11-06 00:07:16,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:07:16,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-06 00:07:16,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:07:16,034 INFO L225 Difference]: With dead ends: 3175 [2021-11-06 00:07:16,034 INFO L226 Difference]: Without dead ends: 3171 [2021-11-06 00:07:16,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.69ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:07:16,035 INFO L933 BasicCegarLoop]: 1340 mSDtfsCounter, 1328 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 2658 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.19ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.13ms IncrementalHoareTripleChecker+Time [2021-11-06 00:07:16,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1328 Valid, 2658 Invalid, 7 Unknown, 0 Unchecked, 2.19ms Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 7.13ms Time] [2021-11-06 00:07:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2021-11-06 00:07:16,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 3171. [2021-11-06 00:07:16,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3171 states, 3139 states have (on average 1.1748964638419879) internal successors, (3688), 3170 states have internal predecessors, (3688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 3688 transitions. [2021-11-06 00:07:16,357 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 3688 transitions. Word has length 67 [2021-11-06 00:07:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:07:16,358 INFO L470 AbstractCegarLoop]: Abstraction has 3171 states and 3688 transitions. [2021-11-06 00:07:16,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 3688 transitions. [2021-11-06 00:07:16,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 00:07:16,359 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:07:16,359 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:07:16,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2021-11-06 00:07:16,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:07:16,561 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:07:16,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:07:16,561 INFO L85 PathProgramCache]: Analyzing trace with hash 761938059, now seen corresponding path program 1 times [2021-11-06 00:07:16,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:07:16,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233988726] [2021-11-06 00:07:16,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:07:16,562 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:07:16,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:07:16,563 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:07:16,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-11-06 00:07:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:07:17,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:07:17,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:07:17,216 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 00:07:17,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:07:17,387 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 00:07:17,387 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:07:17,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233988726] [2021-11-06 00:07:17,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233988726] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:07:17,387 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:07:17,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:07:17,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129268598] [2021-11-06 00:07:17,388 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:07:17,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:07:17,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:07:17,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:07:17,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:07:17,389 INFO L87 Difference]: Start difference. First operand 3171 states and 3688 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:07:17,696 INFO L93 Difference]: Finished difference Result 3171 states and 3688 transitions. [2021-11-06 00:07:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:07:17,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-06 00:07:17,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:07:17,699 INFO L225 Difference]: With dead ends: 3171 [2021-11-06 00:07:17,699 INFO L226 Difference]: Without dead ends: 3167 [2021-11-06 00:07:17,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.72ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:07:17,700 INFO L933 BasicCegarLoop]: 1336 mSDtfsCounter, 1290 mSDsluCounter, 2644 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 3980 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.47ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.88ms IncrementalHoareTripleChecker+Time [2021-11-06 00:07:17,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1290 Valid, 3980 Invalid, 6 Unknown, 0 Unchecked, 2.47ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 6.88ms Time] [2021-11-06 00:07:17,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3167 states. [2021-11-06 00:07:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3167 to 3167. [2021-11-06 00:07:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3167 states, 3137 states have (on average 1.1743704175964298) internal successors, (3684), 3166 states have internal predecessors, (3684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 3684 transitions. [2021-11-06 00:07:18,002 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 3684 transitions. Word has length 69 [2021-11-06 00:07:18,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:07:18,003 INFO L470 AbstractCegarLoop]: Abstraction has 3167 states and 3684 transitions. [2021-11-06 00:07:18,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:18,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 3684 transitions. [2021-11-06 00:07:18,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 00:07:18,004 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:07:18,004 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:07:18,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-11-06 00:07:18,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:07:18,223 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:07:18,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:07:18,224 INFO L85 PathProgramCache]: Analyzing trace with hash 2078189647, now seen corresponding path program 1 times [2021-11-06 00:07:18,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:07:18,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186144639] [2021-11-06 00:07:18,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:07:18,225 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:07:18,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:07:18,226 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:07:18,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-11-06 00:07:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:07:18,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:07:18,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:07:18,867 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 00:07:18,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:07:19,042 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 00:07:19,042 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:07:19,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186144639] [2021-11-06 00:07:19,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186144639] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:07:19,043 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:07:19,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:07:19,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747965110] [2021-11-06 00:07:19,043 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:07:19,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:07:19,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:07:19,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:07:19,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:07:19,044 INFO L87 Difference]: Start difference. First operand 3167 states and 3684 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:19,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:07:19,382 INFO L93 Difference]: Finished difference Result 3167 states and 3684 transitions. [2021-11-06 00:07:19,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:07:19,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-06 00:07:19,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:07:19,386 INFO L225 Difference]: With dead ends: 3167 [2021-11-06 00:07:19,386 INFO L226 Difference]: Without dead ends: 3163 [2021-11-06 00:07:19,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.35ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:07:19,387 INFO L933 BasicCegarLoop]: 1332 mSDtfsCounter, 1284 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 2658 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.17ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.67ms IncrementalHoareTripleChecker+Time [2021-11-06 00:07:19,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1284 Valid, 2658 Invalid, 7 Unknown, 0 Unchecked, 2.17ms Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 6.67ms Time] [2021-11-06 00:07:19,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2021-11-06 00:07:19,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 3163. [2021-11-06 00:07:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3163 states, 3135 states have (on average 1.1738437001594897) internal successors, (3680), 3162 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3163 states to 3163 states and 3680 transitions. [2021-11-06 00:07:19,731 INFO L78 Accepts]: Start accepts. Automaton has 3163 states and 3680 transitions. Word has length 71 [2021-11-06 00:07:19,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:07:19,731 INFO L470 AbstractCegarLoop]: Abstraction has 3163 states and 3680 transitions. [2021-11-06 00:07:19,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3163 states and 3680 transitions. [2021-11-06 00:07:19,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-06 00:07:19,733 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:07:19,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:07:19,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-11-06 00:07:19,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:07:19,952 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:07:19,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:07:19,952 INFO L85 PathProgramCache]: Analyzing trace with hash -19386253, now seen corresponding path program 1 times [2021-11-06 00:07:19,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:07:19,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325764858] [2021-11-06 00:07:19,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:07:19,953 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:07:19,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:07:19,954 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:07:19,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-11-06 00:07:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:07:20,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:07:20,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:07:20,593 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 00:07:20,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:07:20,776 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 00:07:20,776 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:07:20,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325764858] [2021-11-06 00:07:20,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325764858] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:07:20,777 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:07:20,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:07:20,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193259115] [2021-11-06 00:07:20,777 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:07:20,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:07:20,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:07:20,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:07:20,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:07:20,778 INFO L87 Difference]: Start difference. First operand 3163 states and 3680 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:21,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:07:21,098 INFO L93 Difference]: Finished difference Result 3163 states and 3680 transitions. [2021-11-06 00:07:21,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:07:21,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-06 00:07:21,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:07:21,100 INFO L225 Difference]: With dead ends: 3163 [2021-11-06 00:07:21,100 INFO L226 Difference]: Without dead ends: 3047 [2021-11-06 00:07:21,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.94ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:07:21,102 INFO L933 BasicCegarLoop]: 1330 mSDtfsCounter, 1262 mSDsluCounter, 2660 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 3990 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.43ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.27ms IncrementalHoareTripleChecker+Time [2021-11-06 00:07:21,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1262 Valid, 3990 Invalid, 4 Unknown, 0 Unchecked, 2.43ms Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 4.27ms Time] [2021-11-06 00:07:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3047 states. [2021-11-06 00:07:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3047 to 3036. [2021-11-06 00:07:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 3010 states have (on average 1.1777408637873754) internal successors, (3545), 3035 states have internal predecessors, (3545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:21,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 3545 transitions. [2021-11-06 00:07:21,399 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 3545 transitions. Word has length 73 [2021-11-06 00:07:21,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:07:21,399 INFO L470 AbstractCegarLoop]: Abstraction has 3036 states and 3545 transitions. [2021-11-06 00:07:21,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:21,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 3545 transitions. [2021-11-06 00:07:21,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 00:07:21,400 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:07:21,400 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:07:21,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2021-11-06 00:07:21,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:07:21,601 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:07:21,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:07:21,601 INFO L85 PathProgramCache]: Analyzing trace with hash 570246039, now seen corresponding path program 1 times [2021-11-06 00:07:21,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:07:21,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385858331] [2021-11-06 00:07:21,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:07:21,602 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:07:21,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:07:21,603 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:07:21,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-11-06 00:07:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:07:22,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:07:22,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:07:22,351 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 00:07:22,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:07:22,463 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 00:07:22,463 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:07:22,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385858331] [2021-11-06 00:07:22,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385858331] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:07:22,464 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:07:22,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 00:07:22,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360626027] [2021-11-06 00:07:22,464 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:07:22,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:07:22,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:07:22,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:07:22,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:07:22,465 INFO L87 Difference]: Start difference. First operand 3036 states and 3545 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:24,524 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:07:25,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:07:25,481 INFO L93 Difference]: Finished difference Result 6183 states and 7279 transitions. [2021-11-06 00:07:25,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 00:07:25,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-06 00:07:25,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:07:25,486 INFO L225 Difference]: With dead ends: 6183 [2021-11-06 00:07:25,486 INFO L226 Difference]: Without dead ends: 6093 [2021-11-06 00:07:25,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 33.42ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-06 00:07:25,488 INFO L933 BasicCegarLoop]: 2435 mSDtfsCounter, 2136 mSDsluCounter, 5304 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2269.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2136 SdHoareTripleChecker+Valid, 7739 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.49ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2324.42ms IncrementalHoareTripleChecker+Time [2021-11-06 00:07:25,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2136 Valid, 7739 Invalid, 127 Unknown, 0 Unchecked, 5.49ms Time], IncrementalHoareTripleChecker [25 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 2324.42ms Time] [2021-11-06 00:07:25,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6093 states. [2021-11-06 00:07:25,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6093 to 2946. [2021-11-06 00:07:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2946 states, 2928 states have (on average 1.1707650273224044) internal successors, (3428), 2945 states have internal predecessors, (3428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:25,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 3428 transitions. [2021-11-06 00:07:25,801 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 3428 transitions. Word has length 75 [2021-11-06 00:07:25,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:07:25,801 INFO L470 AbstractCegarLoop]: Abstraction has 2946 states and 3428 transitions. [2021-11-06 00:07:25,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:25,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 3428 transitions. [2021-11-06 00:07:25,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-06 00:07:25,802 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:07:25,802 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:07:25,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Ended with exit code 0 [2021-11-06 00:07:26,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:07:26,005 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:07:26,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:07:26,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1562532637, now seen corresponding path program 1 times [2021-11-06 00:07:26,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:07:26,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336553733] [2021-11-06 00:07:26,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:07:26,006 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:07:26,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:07:26,007 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:07:26,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-11-06 00:07:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:07:26,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:07:26,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:07:26,780 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 00:07:26,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:07:27,021 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 00:07:27,022 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:07:27,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [336553733] [2021-11-06 00:07:27,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [336553733] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:07:27,022 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:07:27,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-11-06 00:07:27,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576470306] [2021-11-06 00:07:27,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:07:27,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 00:07:27,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:07:27,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 00:07:27,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-06 00:07:27,023 INFO L87 Difference]: Start difference. First operand 2946 states and 3428 transitions. Second operand has 8 states, 8 states have (on average 19.375) internal successors, (155), 7 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:29,068 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:07:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:07:31,074 INFO L93 Difference]: Finished difference Result 12497 states and 14393 transitions. [2021-11-06 00:07:31,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 00:07:31,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 7 states have internal predecessors, (155), 0 states have call successors, (0), 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 78 [2021-11-06 00:07:31,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:07:31,086 INFO L225 Difference]: With dead ends: 12497 [2021-11-06 00:07:31,087 INFO L226 Difference]: Without dead ends: 12493 [2021-11-06 00:07:31,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 109.68ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-11-06 00:07:31,089 INFO L933 BasicCegarLoop]: 2542 mSDtfsCounter, 12643 mSDsluCounter, 8351 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2356.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 12643 SdHoareTripleChecker+Valid, 10893 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.05ms SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2424.55ms IncrementalHoareTripleChecker+Time [2021-11-06 00:07:31,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12643 Valid, 10893 Invalid, 194 Unknown, 0 Unchecked, 13.05ms Time], IncrementalHoareTripleChecker [55 Valid, 138 Invalid, 1 Unknown, 0 Unchecked, 2424.55ms Time] [2021-11-06 00:07:31,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12493 states. [2021-11-06 00:07:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12493 to 4780. [2021-11-06 00:07:31,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4780 states, 4762 states have (on average 1.1772364552708945) internal successors, (5606), 4779 states have internal predecessors, (5606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4780 states to 4780 states and 5606 transitions. [2021-11-06 00:07:31,722 INFO L78 Accepts]: Start accepts. Automaton has 4780 states and 5606 transitions. Word has length 78 [2021-11-06 00:07:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:07:31,723 INFO L470 AbstractCegarLoop]: Abstraction has 4780 states and 5606 transitions. [2021-11-06 00:07:31,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 7 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 4780 states and 5606 transitions. [2021-11-06 00:07:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-06 00:07:31,724 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:07:31,724 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2021-11-06 00:07:31,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2021-11-06 00:07:31,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:07:31,935 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:07:31,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:07:31,936 INFO L85 PathProgramCache]: Analyzing trace with hash -851092847, now seen corresponding path program 2 times [2021-11-06 00:07:31,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:07:31,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113449218] [2021-11-06 00:07:31,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:07:31,937 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:07:31,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:07:31,938 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:07:31,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-11-06 00:07:32,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 00:07:32,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:07:32,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:07:32,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:07:32,635 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-11-06 00:07:32,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:07:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-11-06 00:07:32,773 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:07:32,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113449218] [2021-11-06 00:07:32,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113449218] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:07:32,774 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:07:32,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 00:07:32,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417001270] [2021-11-06 00:07:32,774 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:07:32,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:07:32,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:07:32,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:07:32,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:07:32,775 INFO L87 Difference]: Start difference. First operand 4780 states and 5606 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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 00:07:34,819 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:07:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:07:36,258 INFO L93 Difference]: Finished difference Result 9593 states and 11358 transitions. [2021-11-06 00:07:36,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 00:07:36,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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 83 [2021-11-06 00:07:36,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:07:36,268 INFO L225 Difference]: With dead ends: 9593 [2021-11-06 00:07:36,268 INFO L226 Difference]: Without dead ends: 9585 [2021-11-06 00:07:36,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.84ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-06 00:07:36,270 INFO L933 BasicCegarLoop]: 2966 mSDtfsCounter, 2213 mSDsluCounter, 5039 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2250.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2213 SdHoareTripleChecker+Valid, 8005 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.74ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2302.76ms IncrementalHoareTripleChecker+Time [2021-11-06 00:07:36,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2213 Valid, 8005 Invalid, 110 Unknown, 0 Unchecked, 5.74ms Time], IncrementalHoareTripleChecker [17 Valid, 92 Invalid, 1 Unknown, 0 Unchecked, 2302.76ms Time] [2021-11-06 00:07:36,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9585 states. [2021-11-06 00:07:36,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9585 to 4772. [2021-11-06 00:07:36,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4772 states, 4758 states have (on average 1.1746532156368221) internal successors, (5589), 4771 states have internal predecessors, (5589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:36,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4772 states to 4772 states and 5589 transitions. [2021-11-06 00:07:36,913 INFO L78 Accepts]: Start accepts. Automaton has 4772 states and 5589 transitions. Word has length 83 [2021-11-06 00:07:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:07:36,913 INFO L470 AbstractCegarLoop]: Abstraction has 4772 states and 5589 transitions. [2021-11-06 00:07:36,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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 00:07:36,914 INFO L276 IsEmpty]: Start isEmpty. Operand 4772 states and 5589 transitions. [2021-11-06 00:07:36,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-06 00:07:36,916 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:07:36,916 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:07:36,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2021-11-06 00:07:37,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:07:37,131 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:07:37,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:07:37,132 INFO L85 PathProgramCache]: Analyzing trace with hash 995900416, now seen corresponding path program 1 times [2021-11-06 00:07:37,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:07:37,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129945300] [2021-11-06 00:07:37,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:07:37,133 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:07:37,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:07:37,134 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:07:37,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-11-06 00:07:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:07:37,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-06 00:07:37,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:07:37,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-06 00:07:37,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:07:38,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-06 00:07:38,245 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:07:38,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129945300] [2021-11-06 00:07:38,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129945300] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:07:38,245 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:07:38,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 00:07:38,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038273965] [2021-11-06 00:07:38,246 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:07:38,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 00:07:38,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:07:38,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 00:07:38,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:07:38,247 INFO L87 Difference]: Start difference. First operand 4772 states and 5589 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:40,293 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:07:41,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:07:41,191 INFO L93 Difference]: Finished difference Result 4772 states and 5589 transitions. [2021-11-06 00:07:41,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 00:07:41,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-06 00:07:41,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:07:41,196 INFO L225 Difference]: With dead ends: 4772 [2021-11-06 00:07:41,196 INFO L226 Difference]: Without dead ends: 4614 [2021-11-06 00:07:41,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.72ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-06 00:07:41,197 INFO L933 BasicCegarLoop]: 1240 mSDtfsCounter, 1166 mSDsluCounter, 3719 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2235.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 4959 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.30ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2286.23ms IncrementalHoareTripleChecker+Time [2021-11-06 00:07:41,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1166 Valid, 4959 Invalid, 139 Unknown, 0 Unchecked, 3.30ms Time], IncrementalHoareTripleChecker [14 Valid, 124 Invalid, 1 Unknown, 0 Unchecked, 2286.23ms Time] [2021-11-06 00:07:41,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4614 states. [2021-11-06 00:07:41,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4614 to 3757. [2021-11-06 00:07:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3757 states, 3745 states have (on average 1.1853137516688919) internal successors, (4439), 3756 states have internal predecessors, (4439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3757 states to 3757 states and 4439 transitions. [2021-11-06 00:07:41,706 INFO L78 Accepts]: Start accepts. Automaton has 3757 states and 4439 transitions. Word has length 99 [2021-11-06 00:07:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:07:41,706 INFO L470 AbstractCegarLoop]: Abstraction has 3757 states and 4439 transitions. [2021-11-06 00:07:41,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3757 states and 4439 transitions. [2021-11-06 00:07:41,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-06 00:07:41,709 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:07:41,709 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:07:41,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Ended with exit code 0 [2021-11-06 00:07:41,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:07:41,923 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:07:41,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:07:41,924 INFO L85 PathProgramCache]: Analyzing trace with hash -238246748, now seen corresponding path program 1 times [2021-11-06 00:07:41,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:07:41,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012426944] [2021-11-06 00:07:41,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:07:41,925 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:07:41,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:07:41,926 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:07:41,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2021-11-06 00:07:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:07:42,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 00:07:42,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:07:43,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-06 00:07:43,179 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 00:07:43,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:07:43,607 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 00:07:43,608 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:07:43,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012426944] [2021-11-06 00:07:43,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012426944] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:07:43,608 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:07:43,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-11-06 00:07:43,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408151579] [2021-11-06 00:07:43,608 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:07:43,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 00:07:43,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:07:43,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 00:07:43,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-06 00:07:43,609 INFO L87 Difference]: Start difference. First operand 3757 states and 4439 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:46,496 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:07:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:07:46,648 INFO L93 Difference]: Finished difference Result 7500 states and 8813 transitions. [2021-11-06 00:07:46,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 00:07:46,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 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 139 [2021-11-06 00:07:46,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:07:46,676 INFO L225 Difference]: With dead ends: 7500 [2021-11-06 00:07:46,676 INFO L226 Difference]: Without dead ends: 4339 [2021-11-06 00:07:46,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 111.46ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-11-06 00:07:46,680 INFO L933 BasicCegarLoop]: 1224 mSDtfsCounter, 249 mSDsluCounter, 5853 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2186.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 7077 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.71ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2321.45ms IncrementalHoareTripleChecker+Time [2021-11-06 00:07:46,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 7077 Invalid, 356 Unknown, 0 Unchecked, 4.71ms Time], IncrementalHoareTripleChecker [10 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 2321.45ms Time] [2021-11-06 00:07:46,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4339 states. [2021-11-06 00:07:47,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4339 to 4146. [2021-11-06 00:07:47,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4146 states, 4134 states have (on average 1.1811804547653604) internal successors, (4883), 4145 states have internal predecessors, (4883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4146 states to 4146 states and 4883 transitions. [2021-11-06 00:07:47,248 INFO L78 Accepts]: Start accepts. Automaton has 4146 states and 4883 transitions. Word has length 139 [2021-11-06 00:07:47,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:07:47,248 INFO L470 AbstractCegarLoop]: Abstraction has 4146 states and 4883 transitions. [2021-11-06 00:07:47,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:47,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4146 states and 4883 transitions. [2021-11-06 00:07:47,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-11-06 00:07:47,251 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:07:47,251 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:07:47,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Ended with exit code 0 [2021-11-06 00:07:47,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:07:47,455 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:07:47,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:07:47,455 INFO L85 PathProgramCache]: Analyzing trace with hash 799037758, now seen corresponding path program 1 times [2021-11-06 00:07:47,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:07:47,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958023434] [2021-11-06 00:07:47,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:07:47,456 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:07:47,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:07:47,457 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:07:47,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2021-11-06 00:07:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:07:48,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-06 00:07:48,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:07:48,551 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 00:07:48,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:07:48,738 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 00:07:48,738 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:07:48,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958023434] [2021-11-06 00:07:48,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958023434] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:07:48,739 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:07:48,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-06 00:07:48,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557426226] [2021-11-06 00:07:48,739 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:07:48,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:07:48,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:07:48,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:07:48,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:07:48,740 INFO L87 Difference]: Start difference. First operand 4146 states and 4883 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:07:50,189 INFO L93 Difference]: Finished difference Result 11570 states and 13683 transitions. [2021-11-06 00:07:50,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 00:07:50,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2021-11-06 00:07:50,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:07:50,200 INFO L225 Difference]: With dead ends: 11570 [2021-11-06 00:07:50,201 INFO L226 Difference]: Without dead ends: 9640 [2021-11-06 00:07:50,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 52.77ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:07:50,204 INFO L933 BasicCegarLoop]: 1843 mSDtfsCounter, 2508 mSDsluCounter, 3654 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 103.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2508 SdHoareTripleChecker+Valid, 5497 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.20ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 121.13ms IncrementalHoareTripleChecker+Time [2021-11-06 00:07:50,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2508 Valid, 5497 Invalid, 41 Unknown, 0 Unchecked, 4.20ms Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 121.13ms Time] [2021-11-06 00:07:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9640 states. [2021-11-06 00:07:50,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9640 to 4162. [2021-11-06 00:07:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4162 states, 4150 states have (on average 1.1804819277108434) internal successors, (4899), 4161 states have internal predecessors, (4899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 4899 transitions. [2021-11-06 00:07:50,847 INFO L78 Accepts]: Start accepts. Automaton has 4162 states and 4899 transitions. Word has length 150 [2021-11-06 00:07:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:07:50,848 INFO L470 AbstractCegarLoop]: Abstraction has 4162 states and 4899 transitions. [2021-11-06 00:07:50,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 4162 states and 4899 transitions. [2021-11-06 00:07:50,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-11-06 00:07:50,851 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:07:50,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:07:50,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Ended with exit code 0 [2021-11-06 00:07:51,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:07:51,051 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:07:51,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:07:51,052 INFO L85 PathProgramCache]: Analyzing trace with hash -18610692, now seen corresponding path program 1 times [2021-11-06 00:07:51,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:07:51,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943085523] [2021-11-06 00:07:51,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:07:51,053 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:07:51,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:07:51,054 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:07:51,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2021-11-06 00:07:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:07:51,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-06 00:07:51,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:07:52,212 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 00:07:52,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:07:52,480 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 00:07:52,480 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:07:52,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943085523] [2021-11-06 00:07:52,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943085523] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:07:52,481 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:07:52,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2021-11-06 00:07:52,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284843424] [2021-11-06 00:07:52,481 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:07:52,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 00:07:52,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:07:52,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 00:07:52,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-06 00:07:52,482 INFO L87 Difference]: Start difference. First operand 4162 states and 4899 transitions. Second operand has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:07:54,808 INFO L93 Difference]: Finished difference Result 13774 states and 16231 transitions. [2021-11-06 00:07:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 00:07:54,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 0 states have call successors, (0), 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 150 [2021-11-06 00:07:54,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:07:54,820 INFO L225 Difference]: With dead ends: 13774 [2021-11-06 00:07:54,821 INFO L226 Difference]: Without dead ends: 11828 [2021-11-06 00:07:54,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 289.73ms TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-11-06 00:07:54,824 INFO L933 BasicCegarLoop]: 1418 mSDtfsCounter, 5848 mSDsluCounter, 11009 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 164.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5848 SdHoareTripleChecker+Valid, 12427 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.90ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 185.92ms IncrementalHoareTripleChecker+Time [2021-11-06 00:07:54,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5848 Valid, 12427 Invalid, 95 Unknown, 0 Unchecked, 9.90ms Time], IncrementalHoareTripleChecker [18 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 185.92ms Time] [2021-11-06 00:07:54,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11828 states. [2021-11-06 00:07:55,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11828 to 4198. [2021-11-06 00:07:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4198 states, 4186 states have (on average 1.1794075489727665) internal successors, (4937), 4197 states have internal predecessors, (4937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4198 states to 4198 states and 4937 transitions. [2021-11-06 00:07:55,516 INFO L78 Accepts]: Start accepts. Automaton has 4198 states and 4937 transitions. Word has length 150 [2021-11-06 00:07:55,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:07:55,517 INFO L470 AbstractCegarLoop]: Abstraction has 4198 states and 4937 transitions. [2021-11-06 00:07:55,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:07:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4198 states and 4937 transitions. [2021-11-06 00:07:55,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-11-06 00:07:55,519 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:07:55,520 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-11-06 00:07:55,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Ended with exit code 0 [2021-11-06 00:07:55,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:07:55,720 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:07:55,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:07:55,721 INFO L85 PathProgramCache]: Analyzing trace with hash -291499080, now seen corresponding path program 2 times [2021-11-06 00:07:55,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:07:55,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152154841] [2021-11-06 00:07:55,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:07:55,722 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:07:55,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:07:55,723 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:07:55,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2021-11-06 00:08:03,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 00:08:03,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:08:03,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:08:03,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:08:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-11-06 00:08:03,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:08:03,824 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-11-06 00:08:03,825 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:08:03,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152154841] [2021-11-06 00:08:03,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152154841] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:08:03,825 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:08:03,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 00:08:03,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056064601] [2021-11-06 00:08:03,825 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:08:03,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:08:03,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:08:03,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:08:03,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:08:03,826 INFO L87 Difference]: Start difference. First operand 4198 states and 4937 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:04,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:08:04,555 INFO L93 Difference]: Finished difference Result 5567 states and 6523 transitions. [2021-11-06 00:08:04,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:08:04,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2021-11-06 00:08:04,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:08:04,558 INFO L225 Difference]: With dead ends: 5567 [2021-11-06 00:08:04,558 INFO L226 Difference]: Without dead ends: 2528 [2021-11-06 00:08:04,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.60ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:08:04,561 INFO L933 BasicCegarLoop]: 1237 mSDtfsCounter, 88 mSDsluCounter, 3360 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 241.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 4597 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.71ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 282.99ms IncrementalHoareTripleChecker+Time [2021-11-06 00:08:04,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 4597 Invalid, 176 Unknown, 0 Unchecked, 2.71ms Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 282.99ms Time] [2021-11-06 00:08:04,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2021-11-06 00:08:04,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2528. [2021-11-06 00:08:04,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2528 states, 2518 states have (on average 1.1715647339158062) internal successors, (2950), 2527 states have internal predecessors, (2950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 2950 transitions. [2021-11-06 00:08:04,936 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 2950 transitions. Word has length 150 [2021-11-06 00:08:04,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:08:04,936 INFO L470 AbstractCegarLoop]: Abstraction has 2528 states and 2950 transitions. [2021-11-06 00:08:04,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:04,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 2950 transitions. [2021-11-06 00:08:04,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-06 00:08:04,939 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:08:04,939 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:08:04,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Ended with exit code 0 [2021-11-06 00:08:05,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:08:05,139 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:08:05,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:08:05,140 INFO L85 PathProgramCache]: Analyzing trace with hash 37726773, now seen corresponding path program 1 times [2021-11-06 00:08:05,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:08:05,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215008149] [2021-11-06 00:08:05,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:08:05,141 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:08:05,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:08:05,142 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:08:05,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2021-11-06 00:08:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:08:06,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:08:06,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:08:06,452 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 00:08:06,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:08:06,804 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 00:08:06,804 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:08:06,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215008149] [2021-11-06 00:08:06,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215008149] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:08:06,805 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:08:06,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:08:06,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936108570] [2021-11-06 00:08:06,805 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:08:06,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:08:06,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:08:06,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:08:06,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:08:06,806 INFO L87 Difference]: Start difference. First operand 2528 states and 2950 transitions. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:07,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:08:07,448 INFO L93 Difference]: Finished difference Result 4758 states and 5553 transitions. [2021-11-06 00:08:07,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:08:07,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 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 153 [2021-11-06 00:08:07,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:08:07,454 INFO L225 Difference]: With dead ends: 4758 [2021-11-06 00:08:07,454 INFO L226 Difference]: Without dead ends: 3636 [2021-11-06 00:08:07,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.68ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:08:07,457 INFO L933 BasicCegarLoop]: 1402 mSDtfsCounter, 954 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 2896 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.22ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.70ms IncrementalHoareTripleChecker+Time [2021-11-06 00:08:07,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [954 Valid, 2896 Invalid, 9 Unknown, 0 Unchecked, 2.22ms Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 33.70ms Time] [2021-11-06 00:08:07,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3636 states. [2021-11-06 00:08:07,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3636 to 2636. [2021-11-06 00:08:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2626 states have (on average 1.1736481340441736) internal successors, (3082), 2635 states have internal predecessors, (3082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3082 transitions. [2021-11-06 00:08:07,879 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3082 transitions. Word has length 153 [2021-11-06 00:08:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:08:07,879 INFO L470 AbstractCegarLoop]: Abstraction has 2636 states and 3082 transitions. [2021-11-06 00:08:07,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3082 transitions. [2021-11-06 00:08:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-06 00:08:07,881 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:08:07,882 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:08:07,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2021-11-06 00:08:08,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:08:08,082 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:08:08,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:08:08,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1996340493, now seen corresponding path program 1 times [2021-11-06 00:08:08,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:08:08,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210947515] [2021-11-06 00:08:08,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:08:08,084 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:08:08,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:08:08,085 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:08:08,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2021-11-06 00:08:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:08:08,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 1010 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 00:08:08,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:08:09,259 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 00:08:09,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:08:09,556 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 00:08:09,556 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:08:09,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210947515] [2021-11-06 00:08:09,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210947515] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:08:09,557 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:08:09,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-11-06 00:08:09,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599105177] [2021-11-06 00:08:09,557 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:08:09,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 00:08:09,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:08:09,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 00:08:09,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-06 00:08:09,558 INFO L87 Difference]: Start difference. First operand 2636 states and 3082 transitions. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:12,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:08:12,190 INFO L93 Difference]: Finished difference Result 10058 states and 11684 transitions. [2021-11-06 00:08:12,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-06 00:08:12,191 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 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 156 [2021-11-06 00:08:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:08:12,200 INFO L225 Difference]: With dead ends: 10058 [2021-11-06 00:08:12,200 INFO L226 Difference]: Without dead ends: 8828 [2021-11-06 00:08:12,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 509.81ms TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2021-11-06 00:08:12,202 INFO L933 BasicCegarLoop]: 1524 mSDtfsCounter, 10598 mSDsluCounter, 10402 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 427.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 10598 SdHoareTripleChecker+Valid, 11926 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.38ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 495.87ms IncrementalHoareTripleChecker+Time [2021-11-06 00:08:12,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10598 Valid, 11926 Invalid, 184 Unknown, 0 Unchecked, 12.38ms Time], IncrementalHoareTripleChecker [28 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 495.87ms Time] [2021-11-06 00:08:12,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8828 states. [2021-11-06 00:08:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8828 to 2702. [2021-11-06 00:08:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2702 states, 2692 states have (on average 1.175334323922734) internal successors, (3164), 2701 states have internal predecessors, (3164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 3164 transitions. [2021-11-06 00:08:12,678 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 3164 transitions. Word has length 156 [2021-11-06 00:08:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:08:12,678 INFO L470 AbstractCegarLoop]: Abstraction has 2702 states and 3164 transitions. [2021-11-06 00:08:12,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:12,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 3164 transitions. [2021-11-06 00:08:12,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-06 00:08:12,680 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:08:12,680 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:08:12,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Ended with exit code 0 [2021-11-06 00:08:12,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:08:12,881 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:08:12,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:08:12,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2120917134, now seen corresponding path program 1 times [2021-11-06 00:08:12,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:08:12,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482798179] [2021-11-06 00:08:12,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:08:12,883 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:08:12,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:08:12,884 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:08:12,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2021-11-06 00:08:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:08:13,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-06 00:08:13,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:08:14,080 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 00:08:14,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:08:14,444 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 00:08:14,444 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:08:14,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482798179] [2021-11-06 00:08:14,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482798179] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:08:14,445 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:08:14,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 14 [2021-11-06 00:08:14,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471738863] [2021-11-06 00:08:14,446 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:08:14,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 00:08:14,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:08:14,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 00:08:14,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-06 00:08:14,447 INFO L87 Difference]: Start difference. First operand 2702 states and 3164 transitions. Second operand has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:16,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:08:16,847 INFO L93 Difference]: Finished difference Result 8004 states and 9354 transitions. [2021-11-06 00:08:16,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 00:08:16,848 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 0 states have call successors, (0), 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 160 [2021-11-06 00:08:16,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:08:16,855 INFO L225 Difference]: With dead ends: 8004 [2021-11-06 00:08:16,855 INFO L226 Difference]: Without dead ends: 6708 [2021-11-06 00:08:16,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 602.14ms TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2021-11-06 00:08:16,858 INFO L933 BasicCegarLoop]: 1752 mSDtfsCounter, 9179 mSDsluCounter, 16088 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 468.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9179 SdHoareTripleChecker+Valid, 17840 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.07ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 529.46ms IncrementalHoareTripleChecker+Time [2021-11-06 00:08:16,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9179 Valid, 17840 Invalid, 290 Unknown, 0 Unchecked, 14.07ms Time], IncrementalHoareTripleChecker [3 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 529.46ms Time] [2021-11-06 00:08:16,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6708 states. [2021-11-06 00:08:17,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6708 to 2718. [2021-11-06 00:08:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2718 states, 2708 states have (on average 1.174298375184638) internal successors, (3180), 2717 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 3180 transitions. [2021-11-06 00:08:17,369 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 3180 transitions. Word has length 160 [2021-11-06 00:08:17,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:08:17,369 INFO L470 AbstractCegarLoop]: Abstraction has 2718 states and 3180 transitions. [2021-11-06 00:08:17,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:17,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 3180 transitions. [2021-11-06 00:08:17,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-06 00:08:17,372 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:08:17,372 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:08:17,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2021-11-06 00:08:17,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:08:17,573 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:08:17,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:08:17,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1107796834, now seen corresponding path program 1 times [2021-11-06 00:08:17,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:08:17,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976261387] [2021-11-06 00:08:17,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:08:17,575 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:08:17,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:08:17,576 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:08:17,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2021-11-06 00:08:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:08:18,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-06 00:08:18,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:08:18,829 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 00:08:18,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:08:19,219 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 00:08:19,220 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:08:19,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976261387] [2021-11-06 00:08:19,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976261387] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:08:19,220 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:08:19,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-11-06 00:08:19,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94181247] [2021-11-06 00:08:19,220 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:08:19,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 00:08:19,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:08:19,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 00:08:19,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-06 00:08:19,222 INFO L87 Difference]: Start difference. First operand 2718 states and 3180 transitions. Second operand has 12 states, 12 states have (on average 15.333333333333334) internal successors, (184), 12 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:08:28,776 INFO L93 Difference]: Finished difference Result 24650 states and 28328 transitions. [2021-11-06 00:08:28,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-11-06 00:08:28,777 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 15.333333333333334) internal successors, (184), 12 states have internal predecessors, (184), 0 states have call successors, (0), 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 161 [2021-11-06 00:08:28,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:08:28,798 INFO L225 Difference]: With dead ends: 24650 [2021-11-06 00:08:28,798 INFO L226 Difference]: Without dead ends: 23338 [2021-11-06 00:08:28,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 2022.55ms TimeCoverageRelationStatistics Valid=712, Invalid=2368, Unknown=0, NotChecked=0, Total=3080 [2021-11-06 00:08:28,803 INFO L933 BasicCegarLoop]: 2806 mSDtfsCounter, 14705 mSDsluCounter, 25897 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1038.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14705 SdHoareTripleChecker+Valid, 28703 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 30.09ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1182.44ms IncrementalHoareTripleChecker+Time [2021-11-06 00:08:28,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14705 Valid, 28703 Invalid, 408 Unknown, 0 Unchecked, 30.09ms Time], IncrementalHoareTripleChecker [21 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 1182.44ms Time] [2021-11-06 00:08:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23338 states. [2021-11-06 00:08:29,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23338 to 2722. [2021-11-06 00:08:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2722 states, 2712 states have (on average 1.1740412979351031) internal successors, (3184), 2721 states have internal predecessors, (3184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 3184 transitions. [2021-11-06 00:08:29,513 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 3184 transitions. Word has length 161 [2021-11-06 00:08:29,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:08:29,513 INFO L470 AbstractCegarLoop]: Abstraction has 2722 states and 3184 transitions. [2021-11-06 00:08:29,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.333333333333334) internal successors, (184), 12 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:29,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 3184 transitions. [2021-11-06 00:08:29,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-11-06 00:08:29,515 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:08:29,516 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:08:29,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2021-11-06 00:08:29,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:08:29,716 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:08:29,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:08:29,717 INFO L85 PathProgramCache]: Analyzing trace with hash 839139744, now seen corresponding path program 1 times [2021-11-06 00:08:29,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:08:29,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832459433] [2021-11-06 00:08:29,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:08:29,718 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:08:29,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:08:29,719 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:08:29,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2021-11-06 00:08:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:08:30,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-06 00:08:30,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:08:30,923 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 00:08:30,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:08:31,329 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 00:08:31,329 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:08:31,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832459433] [2021-11-06 00:08:31,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832459433] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:08:31,330 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:08:31,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 00:08:31,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415021455] [2021-11-06 00:08:31,330 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:08:31,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 00:08:31,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:08:31,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 00:08:31,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:08:31,331 INFO L87 Difference]: Start difference. First operand 2722 states and 3184 transitions. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:33,375 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:08:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:08:34,501 INFO L93 Difference]: Finished difference Result 4412 states and 5164 transitions. [2021-11-06 00:08:34,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 00:08:34,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 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 167 [2021-11-06 00:08:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:08:34,507 INFO L225 Difference]: With dead ends: 4412 [2021-11-06 00:08:34,507 INFO L226 Difference]: Without dead ends: 4400 [2021-11-06 00:08:34,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 31.14ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-06 00:08:34,508 INFO L933 BasicCegarLoop]: 2145 mSDtfsCounter, 3442 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2173.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3442 SdHoareTripleChecker+Valid, 5253 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.07ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2210.02ms IncrementalHoareTripleChecker+Time [2021-11-06 00:08:34,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3442 Valid, 5253 Invalid, 117 Unknown, 0 Unchecked, 5.07ms Time], IncrementalHoareTripleChecker [35 Valid, 81 Invalid, 1 Unknown, 0 Unchecked, 2210.02ms Time] [2021-11-06 00:08:34,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4400 states. [2021-11-06 00:08:35,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4400 to 2710. [2021-11-06 00:08:35,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2706 states have (on average 1.1699926090169992) internal successors, (3166), 2709 states have internal predecessors, (3166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3166 transitions. [2021-11-06 00:08:35,067 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3166 transitions. Word has length 167 [2021-11-06 00:08:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:08:35,067 INFO L470 AbstractCegarLoop]: Abstraction has 2710 states and 3166 transitions. [2021-11-06 00:08:35,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3166 transitions. [2021-11-06 00:08:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-11-06 00:08:35,070 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:08:35,070 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:08:35,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2021-11-06 00:08:35,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:08:35,271 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:08:35,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:08:35,271 INFO L85 PathProgramCache]: Analyzing trace with hash -177750882, now seen corresponding path program 1 times [2021-11-06 00:08:35,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:08:35,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64413229] [2021-11-06 00:08:35,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:08:35,272 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:08:35,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:08:35,273 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:08:35,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2021-11-06 00:08:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:08:36,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 00:08:36,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:08:36,674 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 00:08:36,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:08:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:08:37,133 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:08:37,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64413229] [2021-11-06 00:08:37,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64413229] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:08:37,133 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:08:37,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-06 00:08:37,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180515527] [2021-11-06 00:08:37,133 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:08:37,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:08:37,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:08:37,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:08:37,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:08:37,134 INFO L87 Difference]: Start difference. First operand 2710 states and 3166 transitions. Second operand has 5 states, 5 states have (on average 37.2) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:08:37,906 INFO L93 Difference]: Finished difference Result 4613 states and 5406 transitions. [2021-11-06 00:08:37,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 00:08:37,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 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 186 [2021-11-06 00:08:37,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:08:37,910 INFO L225 Difference]: With dead ends: 4613 [2021-11-06 00:08:37,910 INFO L226 Difference]: Without dead ends: 3309 [2021-11-06 00:08:37,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 30.97ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 00:08:37,912 INFO L933 BasicCegarLoop]: 1794 mSDtfsCounter, 2238 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2238 SdHoareTripleChecker+Valid, 4268 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.54ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.88ms IncrementalHoareTripleChecker+Time [2021-11-06 00:08:37,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2238 Valid, 4268 Invalid, 9 Unknown, 0 Unchecked, 3.54ms Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 15.88ms Time] [2021-11-06 00:08:37,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2021-11-06 00:08:38,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 2710. [2021-11-06 00:08:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2706 states have (on average 1.1692535107169253) internal successors, (3164), 2709 states have internal predecessors, (3164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3164 transitions. [2021-11-06 00:08:38,456 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3164 transitions. Word has length 186 [2021-11-06 00:08:38,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:08:38,456 INFO L470 AbstractCegarLoop]: Abstraction has 2710 states and 3164 transitions. [2021-11-06 00:08:38,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:38,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3164 transitions. [2021-11-06 00:08:38,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-11-06 00:08:38,459 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:08:38,459 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:08:38,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Ended with exit code 0 [2021-11-06 00:08:38,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:08:38,659 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:08:38,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:08:38,660 INFO L85 PathProgramCache]: Analyzing trace with hash -177691300, now seen corresponding path program 1 times [2021-11-06 00:08:38,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:08:38,661 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11188445] [2021-11-06 00:08:38,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:08:38,661 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:08:38,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:08:38,662 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:08:38,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2021-11-06 00:08:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:08:39,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-06 00:08:39,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:08:39,894 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 00:08:39,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:08:40,085 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 00:08:40,086 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:08:40,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11188445] [2021-11-06 00:08:40,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11188445] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:08:40,086 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:08:40,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 00:08:40,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685295687] [2021-11-06 00:08:40,086 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:08:40,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:08:40,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:08:40,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:08:40,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:08:40,087 INFO L87 Difference]: Start difference. First operand 2710 states and 3164 transitions. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:40,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:08:40,838 INFO L93 Difference]: Finished difference Result 3312 states and 3872 transitions. [2021-11-06 00:08:40,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:08:40,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 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 186 [2021-11-06 00:08:40,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:08:40,842 INFO L225 Difference]: With dead ends: 3312 [2021-11-06 00:08:40,842 INFO L226 Difference]: Without dead ends: 3310 [2021-11-06 00:08:40,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.48ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:08:40,844 INFO L933 BasicCegarLoop]: 1796 mSDtfsCounter, 1909 mSDsluCounter, 2317 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1909 SdHoareTripleChecker+Valid, 4113 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.76ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.40ms IncrementalHoareTripleChecker+Time [2021-11-06 00:08:40,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1909 Valid, 4113 Invalid, 3 Unknown, 0 Unchecked, 2.76ms Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 5.40ms Time] [2021-11-06 00:08:40,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2021-11-06 00:08:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 2708. [2021-11-06 00:08:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2708 states, 2705 states have (on average 1.1685767097966728) internal successors, (3161), 2707 states have internal predecessors, (3161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 3161 transitions. [2021-11-06 00:08:41,458 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 3161 transitions. Word has length 186 [2021-11-06 00:08:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:08:41,459 INFO L470 AbstractCegarLoop]: Abstraction has 2708 states and 3161 transitions. [2021-11-06 00:08:41,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:41,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3161 transitions. [2021-11-06 00:08:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-11-06 00:08:41,461 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:08:41,461 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:08:41,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (48)] Ended with exit code 0 [2021-11-06 00:08:41,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:08:41,662 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:08:41,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:08:41,662 INFO L85 PathProgramCache]: Analyzing trace with hash 2099489264, now seen corresponding path program 1 times [2021-11-06 00:08:41,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:08:41,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93072057] [2021-11-06 00:08:41,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:08:41,663 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:08:41,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:08:41,664 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:08:41,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2021-11-06 00:08:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:08:42,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 1145 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 00:08:42,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:08:43,066 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 00:08:43,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:08:43,498 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 00:08:43,499 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:08:43,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93072057] [2021-11-06 00:08:43,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93072057] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:08:43,499 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:08:43,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-06 00:08:43,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082451000] [2021-11-06 00:08:43,499 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:08:43,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:08:43,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:08:43,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:08:43,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:08:43,500 INFO L87 Difference]: Start difference. First operand 2708 states and 3161 transitions. Second operand has 4 states, 4 states have (on average 94.0) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:08:44,064 INFO L93 Difference]: Finished difference Result 4006 states and 4686 transitions. [2021-11-06 00:08:44,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:08:44,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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 189 [2021-11-06 00:08:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:08:44,067 INFO L225 Difference]: With dead ends: 4006 [2021-11-06 00:08:44,068 INFO L226 Difference]: Without dead ends: 2704 [2021-11-06 00:08:44,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.82ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:08:44,069 INFO L933 BasicCegarLoop]: 1216 mSDtfsCounter, 2062 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2062 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.72ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.83ms IncrementalHoareTripleChecker+Time [2021-11-06 00:08:44,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2062 Valid, 1216 Invalid, 1 Unknown, 0 Unchecked, 1.72ms Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 1.83ms Time] [2021-11-06 00:08:44,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2021-11-06 00:08:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2021-11-06 00:08:44,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2702 states have (on average 1.1672834937083643) internal successors, (3154), 2703 states have internal predecessors, (3154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3154 transitions. [2021-11-06 00:08:44,652 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3154 transitions. Word has length 189 [2021-11-06 00:08:44,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:08:44,652 INFO L470 AbstractCegarLoop]: Abstraction has 2704 states and 3154 transitions. [2021-11-06 00:08:44,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:44,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3154 transitions. [2021-11-06 00:08:44,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-11-06 00:08:44,655 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:08:44,655 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:08:44,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (49)] Ended with exit code 0 [2021-11-06 00:08:44,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:08:44,856 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:08:44,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:08:44,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1722921435, now seen corresponding path program 1 times [2021-11-06 00:08:44,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:08:44,857 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944791602] [2021-11-06 00:08:44,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:08:44,857 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:08:44,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:08:44,858 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:08:44,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2021-11-06 00:08:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:08:45,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-06 00:08:45,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:08:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-06 00:08:46,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:08:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-06 00:08:46,680 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:08:46,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944791602] [2021-11-06 00:08:46,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944791602] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:08:46,680 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:08:46,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-11-06 00:08:46,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985176371] [2021-11-06 00:08:46,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:08:46,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 00:08:46,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:08:46,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 00:08:46,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:08:46,681 INFO L87 Difference]: Start difference. First operand 2704 states and 3154 transitions. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:48,729 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:08:49,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:08:49,444 INFO L93 Difference]: Finished difference Result 2704 states and 3154 transitions. [2021-11-06 00:08:49,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 00:08:49,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 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 192 [2021-11-06 00:08:49,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:08:49,448 INFO L225 Difference]: With dead ends: 2704 [2021-11-06 00:08:49,448 INFO L226 Difference]: Without dead ends: 2472 [2021-11-06 00:08:49,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.97ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-06 00:08:49,449 INFO L933 BasicCegarLoop]: 1201 mSDtfsCounter, 1032 mSDsluCounter, 3602 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2134.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 4803 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.84ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2167.46ms IncrementalHoareTripleChecker+Time [2021-11-06 00:08:49,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1032 Valid, 4803 Invalid, 65 Unknown, 0 Unchecked, 2.84ms Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 1 Unknown, 0 Unchecked, 2167.46ms Time] [2021-11-06 00:08:49,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2021-11-06 00:08:49,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2283. [2021-11-06 00:08:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2283 states, 2282 states have (on average 1.1783523225241017) internal successors, (2689), 2282 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 2689 transitions. [2021-11-06 00:08:49,908 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 2689 transitions. Word has length 192 [2021-11-06 00:08:49,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:08:49,908 INFO L470 AbstractCegarLoop]: Abstraction has 2283 states and 2689 transitions. [2021-11-06 00:08:49,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:49,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 2689 transitions. [2021-11-06 00:08:49,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2021-11-06 00:08:49,911 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:08:49,911 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:08:49,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2021-11-06 00:08:50,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:08:50,111 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:08:50,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:08:50,112 INFO L85 PathProgramCache]: Analyzing trace with hash 239066584, now seen corresponding path program 1 times [2021-11-06 00:08:50,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:08:50,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672676497] [2021-11-06 00:08:50,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:08:50,113 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:08:50,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:08:50,114 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:08:50,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2021-11-06 00:08:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:08:51,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-06 00:08:51,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:08:51,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:08:51,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:08:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:08:52,292 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:08:52,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672676497] [2021-11-06 00:08:52,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672676497] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:08:52,293 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:08:52,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2021-11-06 00:08:52,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525624426] [2021-11-06 00:08:52,293 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:08:52,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 00:08:52,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:08:52,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 00:08:52,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-06 00:08:52,294 INFO L87 Difference]: Start difference. First operand 2283 states and 2689 transitions. Second operand has 14 states, 14 states have (on average 20.571428571428573) internal successors, (288), 14 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:54,666 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:08:55,943 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:08:57,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:08:57,071 INFO L93 Difference]: Finished difference Result 6515 states and 7683 transitions. [2021-11-06 00:08:57,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 00:08:57,073 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.571428571428573) internal successors, (288), 14 states have internal predecessors, (288), 0 states have call successors, (0), 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 281 [2021-11-06 00:08:57,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:08:57,077 INFO L225 Difference]: With dead ends: 6515 [2021-11-06 00:08:57,078 INFO L226 Difference]: Without dead ends: 5342 [2021-11-06 00:08:57,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 365.67ms TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2021-11-06 00:08:57,079 INFO L933 BasicCegarLoop]: 1787 mSDtfsCounter, 7635 mSDsluCounter, 19671 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3188.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7635 SdHoareTripleChecker+Valid, 21458 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.97ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3262.50ms IncrementalHoareTripleChecker+Time [2021-11-06 00:08:57,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7635 Valid, 21458 Invalid, 89 Unknown, 0 Unchecked, 11.97ms Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 3262.50ms Time] [2021-11-06 00:08:57,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5342 states. [2021-11-06 00:08:57,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5342 to 2295. [2021-11-06 00:08:57,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 2294 states have (on average 1.1774193548387097) internal successors, (2701), 2294 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 2701 transitions. [2021-11-06 00:08:57,622 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 2701 transitions. Word has length 281 [2021-11-06 00:08:57,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:08:57,623 INFO L470 AbstractCegarLoop]: Abstraction has 2295 states and 2701 transitions. [2021-11-06 00:08:57,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.571428571428573) internal successors, (288), 14 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:08:57,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2701 transitions. [2021-11-06 00:08:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2021-11-06 00:08:57,626 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:08:57,626 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:08:57,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (51)] Forceful destruction successful, exit code 0 [2021-11-06 00:08:57,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:08:57,827 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:08:57,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:08:57,828 INFO L85 PathProgramCache]: Analyzing trace with hash -589978396, now seen corresponding path program 1 times [2021-11-06 00:08:57,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:08:57,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969180159] [2021-11-06 00:08:57,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:08:57,829 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:08:57,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:08:57,830 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:08:57,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2021-11-06 00:08:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:08:59,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 00:08:59,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:08:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:08:59,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:08:59,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:08:59,766 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:08:59,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969180159] [2021-11-06 00:08:59,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969180159] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:08:59,767 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:08:59,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-06 00:08:59,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230310057] [2021-11-06 00:08:59,767 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:08:59,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 00:08:59,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:08:59,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 00:08:59,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:08:59,768 INFO L87 Difference]: Start difference. First operand 2295 states and 2701 transitions. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:09:00,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:09:00,621 INFO L93 Difference]: Finished difference Result 4445 states and 5239 transitions. [2021-11-06 00:09:00,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:09:00,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 287 [2021-11-06 00:09:00,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:09:00,628 INFO L225 Difference]: With dead ends: 4445 [2021-11-06 00:09:00,628 INFO L226 Difference]: Without dead ends: 3260 [2021-11-06 00:09:00,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 571 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.63ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:09:00,630 INFO L933 BasicCegarLoop]: 1724 mSDtfsCounter, 534 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 2910 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.09ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.17ms IncrementalHoareTripleChecker+Time [2021-11-06 00:09:00,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 2910 Invalid, 6 Unknown, 0 Unchecked, 2.09ms Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 28.17ms Time] [2021-11-06 00:09:00,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3260 states. [2021-11-06 00:09:01,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3260 to 2297. [2021-11-06 00:09:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2297 states, 2296 states have (on average 1.1772648083623694) internal successors, (2703), 2296 states have internal predecessors, (2703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:09:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 2297 states and 2703 transitions. [2021-11-06 00:09:01,148 INFO L78 Accepts]: Start accepts. Automaton has 2297 states and 2703 transitions. Word has length 287 [2021-11-06 00:09:01,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:09:01,148 INFO L470 AbstractCegarLoop]: Abstraction has 2297 states and 2703 transitions. [2021-11-06 00:09:01,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:09:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 2703 transitions. [2021-11-06 00:09:01,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2021-11-06 00:09:01,151 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:09:01,152 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:09:01,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (52)] Ended with exit code 0 [2021-11-06 00:09:01,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:09:01,352 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:09:01,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:09:01,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1732480862, now seen corresponding path program 1 times [2021-11-06 00:09:01,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:09:01,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305423419] [2021-11-06 00:09:01,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:09:01,354 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:09:01,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:09:01,355 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:09:01,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (53)] Waiting until timeout for monitored process [2021-11-06 00:09:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:09:02,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:09:02,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:09:02,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:09:02,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:09:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:09:03,344 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:09:03,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305423419] [2021-11-06 00:09:03,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305423419] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:09:03,344 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:09:03,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-06 00:09:03,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834298806] [2021-11-06 00:09:03,344 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:09:03,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 00:09:03,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:09:03,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 00:09:03,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-06 00:09:03,345 INFO L87 Difference]: Start difference. First operand 2297 states and 2703 transitions. Second operand has 8 states, 8 states have (on average 36.375) internal successors, (291), 8 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:09:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:09:04,651 INFO L93 Difference]: Finished difference Result 5152 states and 6054 transitions. [2021-11-06 00:09:04,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 00:09:04,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 36.375) internal successors, (291), 8 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 287 [2021-11-06 00:09:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:09:04,656 INFO L225 Difference]: With dead ends: 5152 [2021-11-06 00:09:04,656 INFO L226 Difference]: Without dead ends: 4497 [2021-11-06 00:09:04,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 43.37ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-06 00:09:04,658 INFO L933 BasicCegarLoop]: 2066 mSDtfsCounter, 3473 mSDsluCounter, 9083 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3473 SdHoareTripleChecker+Valid, 11149 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.24ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.47ms IncrementalHoareTripleChecker+Time [2021-11-06 00:09:04,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3473 Valid, 11149 Invalid, 29 Unknown, 0 Unchecked, 6.24ms Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 54.47ms Time] [2021-11-06 00:09:04,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4497 states. [2021-11-06 00:09:05,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4497 to 2300. [2021-11-06 00:09:05,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2300 states, 2299 states have (on average 1.1770334928229664) internal successors, (2706), 2299 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:09:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2300 states to 2300 states and 2706 transitions. [2021-11-06 00:09:05,219 INFO L78 Accepts]: Start accepts. Automaton has 2300 states and 2706 transitions. Word has length 287 [2021-11-06 00:09:05,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:09:05,219 INFO L470 AbstractCegarLoop]: Abstraction has 2300 states and 2706 transitions. [2021-11-06 00:09:05,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 36.375) internal successors, (291), 8 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:09:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2300 states and 2706 transitions. [2021-11-06 00:09:05,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2021-11-06 00:09:05,222 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:09:05,222 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:09:05,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (53)] Ended with exit code 0 [2021-11-06 00:09:05,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:09:05,423 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:09:05,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:09:05,423 INFO L85 PathProgramCache]: Analyzing trace with hash -786248474, now seen corresponding path program 1 times [2021-11-06 00:09:05,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:09:05,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605205654] [2021-11-06 00:09:05,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:09:05,425 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:09:05,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:09:05,426 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:09:05,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (54)] Waiting until timeout for monitored process [2021-11-06 00:09:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:09:06,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 1582 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-06 00:09:06,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:09:07,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:09:07,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:09:09,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:09:09,718 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:09:09,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605205654] [2021-11-06 00:09:09,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605205654] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:09:09,718 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:09:09,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 15] imperfect sequences [] total 27 [2021-11-06 00:09:09,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350302371] [2021-11-06 00:09:09,719 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:09:09,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-06 00:09:09,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:09:09,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-06 00:09:09,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2021-11-06 00:09:09,720 INFO L87 Difference]: Start difference. First operand 2300 states and 2706 transitions. Second operand has 27 states, 27 states have (on average 12.666666666666666) internal successors, (342), 27 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:09:15,908 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:09:17,930 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:09:19,381 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:09:21,400 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:09:23,413 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:09:24,587 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:09:35,686 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:09:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:09:39,750 INFO L93 Difference]: Finished difference Result 13253 states and 15585 transitions. [2021-11-06 00:09:39,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-11-06 00:09:39,751 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 12.666666666666666) internal successors, (342), 27 states have internal predecessors, (342), 0 states have call successors, (0), 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 299 [2021-11-06 00:09:39,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:09:39,762 INFO L225 Difference]: With dead ends: 13253 [2021-11-06 00:09:39,762 INFO L226 Difference]: Without dead ends: 12063 [2021-11-06 00:09:39,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 587 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2089 ImplicationChecksByTransitivity, 9140.88ms TimeCoverageRelationStatistics Valid=2172, Invalid=6758, Unknown=0, NotChecked=0, Total=8930 [2021-11-06 00:09:39,764 INFO L933 BasicCegarLoop]: 2691 mSDtfsCounter, 22917 mSDsluCounter, 39922 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 20 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17026.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 22917 SdHoareTripleChecker+Valid, 42613 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 47.28ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17638.08ms IncrementalHoareTripleChecker+Time [2021-11-06 00:09:39,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22917 Valid, 42613 Invalid, 1553 Unknown, 0 Unchecked, 47.28ms Time], IncrementalHoareTripleChecker [20 Valid, 1529 Invalid, 4 Unknown, 0 Unchecked, 17638.08ms Time] [2021-11-06 00:09:39,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12063 states. [2021-11-06 00:09:40,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12063 to 2308. [2021-11-06 00:09:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2308 states, 2307 states have (on average 1.17641959254443) internal successors, (2714), 2307 states have internal predecessors, (2714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:09:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 2714 transitions. [2021-11-06 00:09:40,456 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 2714 transitions. Word has length 299 [2021-11-06 00:09:40,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:09:40,456 INFO L470 AbstractCegarLoop]: Abstraction has 2308 states and 2714 transitions. [2021-11-06 00:09:40,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 12.666666666666666) internal successors, (342), 27 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:09:40,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 2714 transitions. [2021-11-06 00:09:40,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2021-11-06 00:09:40,459 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:09:40,459 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:09:40,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (54)] Ended with exit code 0 [2021-11-06 00:09:40,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:09:40,660 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:09:40,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:09:40,660 INFO L85 PathProgramCache]: Analyzing trace with hash 738210640, now seen corresponding path program 1 times [2021-11-06 00:09:40,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:09:40,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762441567] [2021-11-06 00:09:40,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:09:40,662 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:09:40,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:09:40,663 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:09:40,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (55)] Waiting until timeout for monitored process [2021-11-06 00:09:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:09:42,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 1586 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-06 00:09:42,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:09:43,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:09:43,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:09:43,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:09:43,725 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:09:43,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762441567] [2021-11-06 00:09:43,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762441567] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:09:43,725 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:09:43,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 13 [2021-11-06 00:09:43,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334156929] [2021-11-06 00:09:43,725 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:09:43,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 00:09:43,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:09:43,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 00:09:43,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-11-06 00:09:43,726 INFO L87 Difference]: Start difference. First operand 2308 states and 2714 transitions. Second operand has 13 states, 13 states have (on average 23.307692307692307) internal successors, (303), 13 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:09:48,031 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:09:53,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:09:53,638 INFO L93 Difference]: Finished difference Result 7327 states and 8647 transitions. [2021-11-06 00:09:53,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-06 00:09:53,641 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 23.307692307692307) internal successors, (303), 13 states have internal predecessors, (303), 0 states have call successors, (0), 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 301 [2021-11-06 00:09:53,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:09:53,647 INFO L225 Difference]: With dead ends: 7327 [2021-11-06 00:09:53,647 INFO L226 Difference]: Without dead ends: 6129 [2021-11-06 00:09:53,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 596 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2402.57ms TimeCoverageRelationStatistics Valid=211, Invalid=545, Unknown=0, NotChecked=0, Total=756 [2021-11-06 00:09:53,649 INFO L933 BasicCegarLoop]: 2337 mSDtfsCounter, 9187 mSDsluCounter, 17206 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4932.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9187 SdHoareTripleChecker+Valid, 19543 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.52ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5428.39ms IncrementalHoareTripleChecker+Time [2021-11-06 00:09:53,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9187 Valid, 19543 Invalid, 731 Unknown, 0 Unchecked, 20.52ms Time], IncrementalHoareTripleChecker [23 Valid, 707 Invalid, 1 Unknown, 0 Unchecked, 5428.39ms Time] [2021-11-06 00:09:53,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6129 states. [2021-11-06 00:09:54,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6129 to 2356. [2021-11-06 00:09:54,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 2355 states have (on average 1.1762208067940552) internal successors, (2770), 2355 states have internal predecessors, (2770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:09:54,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 2770 transitions. [2021-11-06 00:09:54,364 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 2770 transitions. Word has length 301 [2021-11-06 00:09:54,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:09:54,365 INFO L470 AbstractCegarLoop]: Abstraction has 2356 states and 2770 transitions. [2021-11-06 00:09:54,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 23.307692307692307) internal successors, (303), 13 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:09:54,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 2770 transitions. [2021-11-06 00:09:54,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2021-11-06 00:09:54,368 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:09:54,368 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:09:54,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (55)] Ended with exit code 0 [2021-11-06 00:09:54,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:09:54,568 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:09:54,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:09:54,569 INFO L85 PathProgramCache]: Analyzing trace with hash 612975810, now seen corresponding path program 1 times [2021-11-06 00:09:54,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:09:54,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767435122] [2021-11-06 00:09:54,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:09:54,570 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:09:54,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:09:54,571 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:09:54,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (56)] Waiting until timeout for monitored process [2021-11-06 00:09:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:09:56,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 1589 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-06 00:09:56,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:09:56,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:09:56,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:09:58,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:09:58,303 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:09:58,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767435122] [2021-11-06 00:09:58,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767435122] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:09:58,303 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:09:58,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 13] imperfect sequences [] total 27 [2021-11-06 00:09:58,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140605355] [2021-11-06 00:09:58,304 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:09:58,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-06 00:09:58,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:09:58,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-06 00:09:58,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2021-11-06 00:09:58,305 INFO L87 Difference]: Start difference. First operand 2356 states and 2770 transitions. Second operand has 27 states, 27 states have (on average 13.925925925925926) internal successors, (376), 27 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:10:08,872 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:10:29,255 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:10:50,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:10:50,093 INFO L93 Difference]: Finished difference Result 34978 states and 41068 transitions. [2021-11-06 00:10:50,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2021-11-06 00:10:50,096 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 13.925925925925926) internal successors, (376), 27 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 309 [2021-11-06 00:10:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:10:50,135 INFO L225 Difference]: With dead ends: 34978 [2021-11-06 00:10:50,135 INFO L226 Difference]: Without dead ends: 33732 [2021-11-06 00:10:50,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 649 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15919 ImplicationChecksByTransitivity, 17361.81ms TimeCoverageRelationStatistics Valid=5641, Invalid=36589, Unknown=0, NotChecked=0, Total=42230 [2021-11-06 00:10:50,146 INFO L933 BasicCegarLoop]: 5937 mSDtfsCounter, 82806 mSDsluCounter, 68236 mSDsCounter, 0 mSdLazyCounter, 4856 mSolverCounterSat, 288 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16389.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 82806 SdHoareTripleChecker+Valid, 74173 SdHoareTripleChecker+Invalid, 5146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 117.31ms SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 4856 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18036.56ms IncrementalHoareTripleChecker+Time [2021-11-06 00:10:50,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82806 Valid, 74173 Invalid, 5146 Unknown, 0 Unchecked, 117.31ms Time], IncrementalHoareTripleChecker [288 Valid, 4856 Invalid, 2 Unknown, 0 Unchecked, 18036.56ms Time] [2021-11-06 00:10:50,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33732 states. [2021-11-06 00:10:51,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33732 to 2360. [2021-11-06 00:10:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 2359 states have (on average 1.1759220008478168) internal successors, (2774), 2359 states have internal predecessors, (2774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:10:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 2774 transitions. [2021-11-06 00:10:51,184 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 2774 transitions. Word has length 309 [2021-11-06 00:10:51,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:10:51,184 INFO L470 AbstractCegarLoop]: Abstraction has 2360 states and 2774 transitions. [2021-11-06 00:10:51,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 13.925925925925926) internal successors, (376), 27 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:10:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 2774 transitions. [2021-11-06 00:10:51,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2021-11-06 00:10:51,187 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:10:51,187 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:10:51,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (56)] Ended with exit code 0 [2021-11-06 00:10:51,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:10:51,388 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:10:51,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:10:51,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1038238280, now seen corresponding path program 1 times [2021-11-06 00:10:51,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:10:51,390 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759294574] [2021-11-06 00:10:51,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:10:51,390 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:10:51,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:10:51,391 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:10:51,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (57)] Waiting until timeout for monitored process [2021-11-06 00:10:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:10:52,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:10:52,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:10:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:10:53,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:10:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:10:53,725 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:10:53,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759294574] [2021-11-06 00:10:53,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759294574] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:10:53,725 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:10:53,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-06 00:10:53,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111986670] [2021-11-06 00:10:53,726 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:10:53,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 00:10:53,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:10:53,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 00:10:53,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-06 00:10:53,727 INFO L87 Difference]: Start difference. First operand 2360 states and 2774 transitions. Second operand has 8 states, 8 states have (on average 39.625) internal successors, (317), 8 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:10:57,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:10:57,720 INFO L93 Difference]: Finished difference Result 10845 states and 12726 transitions. [2021-11-06 00:10:57,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 00:10:57,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 39.625) internal successors, (317), 8 states have internal predecessors, (317), 0 states have call successors, (0), 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 313 [2021-11-06 00:10:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:10:57,731 INFO L225 Difference]: With dead ends: 10845 [2021-11-06 00:10:57,731 INFO L226 Difference]: Without dead ends: 8603 [2021-11-06 00:10:57,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 51.75ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-06 00:10:57,733 INFO L933 BasicCegarLoop]: 2958 mSDtfsCounter, 7332 mSDsluCounter, 12574 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 306.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7332 SdHoareTripleChecker+Valid, 15532 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.29ms SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 359.12ms IncrementalHoareTripleChecker+Time [2021-11-06 00:10:57,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7332 Valid, 15532 Invalid, 185 Unknown, 0 Unchecked, 11.29ms Time], IncrementalHoareTripleChecker [31 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 359.12ms Time] [2021-11-06 00:10:57,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8603 states. [2021-11-06 00:10:58,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8603 to 2417. [2021-11-06 00:10:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2417 states, 2416 states have (on average 1.171771523178808) internal successors, (2831), 2416 states have internal predecessors, (2831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:10:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 2831 transitions. [2021-11-06 00:10:58,729 INFO L78 Accepts]: Start accepts. Automaton has 2417 states and 2831 transitions. Word has length 313 [2021-11-06 00:10:58,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:10:58,729 INFO L470 AbstractCegarLoop]: Abstraction has 2417 states and 2831 transitions. [2021-11-06 00:10:58,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 39.625) internal successors, (317), 8 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:10:58,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 2831 transitions. [2021-11-06 00:10:58,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2021-11-06 00:10:58,732 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:10:58,732 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:10:58,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (57)] Forceful destruction successful, exit code 0 [2021-11-06 00:10:58,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:10:58,938 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 00:10:58,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:10:58,938 INFO L85 PathProgramCache]: Analyzing trace with hash -306270854, now seen corresponding path program 1 times [2021-11-06 00:10:58,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:10:58,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974434872] [2021-11-06 00:10:58,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:10:58,940 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:10:58,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:10:58,940 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:10:58,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (58)] Waiting until timeout for monitored process [2021-11-06 00:11:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:11:03,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-06 00:11:03,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:11:04,569 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-06 00:11:04,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 21 [2021-11-06 00:11:05,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-11-06 00:11:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:11:06,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:11:17,406 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (_ BitVec 32)) (v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_26 (_ BitVec 64))) (= (select (select (store |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base (store (select |c_#memory_int| c_ULTIMATE.start_ldv_xmalloc_~res~4.base) v_ULTIMATE.start_ldv_dispatch_register_10_2_~cf_arg_4~0.offset_26 v_DerPreprocessor_1)) |c_~#nfnl_log_net_id~0.base|) |c_~#nfnl_log_net_id~0.offset|) (_ bv0 32))) is different from false Killed by 15