./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 4d014703 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-4d01470 [2021-11-03 04:35:38,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 04:35:38,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 04:35:38,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 04:35:38,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 04:35:38,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 04:35:38,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 04:35:38,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 04:35:38,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 04:35:38,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 04:35:38,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 04:35:38,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 04:35:38,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 04:35:38,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 04:35:38,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 04:35:38,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 04:35:38,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 04:35:38,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 04:35:38,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 04:35:38,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 04:35:38,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 04:35:38,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 04:35:38,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 04:35:38,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 04:35:38,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 04:35:38,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 04:35:38,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 04:35:38,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 04:35:38,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 04:35:38,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 04:35:38,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 04:35:38,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 04:35:38,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 04:35:38,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 04:35:38,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 04:35:38,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 04:35:38,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 04:35:38,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 04:35:38,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 04:35:38,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 04:35:38,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 04:35:38,558 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-03 04:35:38,588 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 04:35:38,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 04:35:38,590 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-03 04:35:38,591 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-03 04:35:38,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 04:35:38,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 04:35:38,592 INFO L138 SettingsManager]: * Use SBE=true [2021-11-03 04:35:38,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 04:35:38,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 04:35:38,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 04:35:38,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 04:35:38,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 04:35:38,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 04:35:38,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 04:35:38,595 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 04:35:38,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 04:35:38,595 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 04:35:38,595 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-03 04:35:38,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 04:35:38,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:35:38,596 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 04:35:38,596 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 04:35:38,596 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 04:35:38,596 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-03 04:35:38,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 04:35:38,597 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-03 04:35:38,597 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-03 04:35:38,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 04:35:38,598 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 04:35:38,599 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-03 04:35:38,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 04:35:38,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 04:35:38,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 04:35:38,837 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 04:35:38,838 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 04:35:38,840 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-03 04:35:38,903 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f9bb434/4b38709569dc4598ba53b7a2da5302c1/FLAG33ec0a95e [2021-11-03 04:35:39,766 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 04:35:39,767 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-03 04:35:39,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f9bb434/4b38709569dc4598ba53b7a2da5302c1/FLAG33ec0a95e [2021-11-03 04:35:40,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f9bb434/4b38709569dc4598ba53b7a2da5302c1 [2021-11-03 04:35:40,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 04:35:40,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 04:35:40,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 04:35:40,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 04:35:40,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 04:35:40,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:35:40" (1/1) ... [2021-11-03 04:35:40,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bc247ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:35:40, skipping insertion in model container [2021-11-03 04:35:40,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:35:40" (1/1) ... [2021-11-03 04:35:40,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 04:35:40,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 04:35:44,054 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400642,400655] [2021-11-03 04:35:44,057 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400787,400800] [2021-11-03 04:35:44,058 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400933,400946] [2021-11-03 04:35:44,058 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401098,401111] [2021-11-03 04:35:44,063 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401256,401269] [2021-11-03 04:35:44,065 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401414,401427] [2021-11-03 04:35:44,065 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401572,401585] [2021-11-03 04:35:44,066 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401732,401745] [2021-11-03 04:35:44,066 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401891,401904] [2021-11-03 04:35:44,066 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402030,402043] [2021-11-03 04:35:44,067 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402172,402185] [2021-11-03 04:35:44,067 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402321,402334] [2021-11-03 04:35:44,068 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,068 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,069 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,072 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,072 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,073 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,074 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,074 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,074 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,075 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,075 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,075 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,076 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,077 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,078 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,078 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,079 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,080 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,080 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,081 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,081 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,082 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,082 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,082 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,083 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,084 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,084 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,084 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,085 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,085 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,086 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,086 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,087 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407344,407357] [2021-11-03 04:35:44,087 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407507,407520] [2021-11-03 04:35:44,087 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407673,407686] [2021-11-03 04:35:44,088 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407837,407850] [2021-11-03 04:35:44,089 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408002,408015] [2021-11-03 04:35:44,089 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408167,408180] [2021-11-03 04:35:44,090 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408333,408346] [2021-11-03 04:35:44,090 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408498,408511] [2021-11-03 04:35:44,090 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408665,408678] [2021-11-03 04:35:44,091 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408825,408838] [2021-11-03 04:35:44,091 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408987,409000] [2021-11-03 04:35:44,092 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409146,409159] [2021-11-03 04:35:44,092 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409292,409305] [2021-11-03 04:35:44,092 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409435,409448] [2021-11-03 04:35:44,093 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409579,409592] [2021-11-03 04:35:44,093 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409722,409735] [2021-11-03 04:35:44,093 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409866,409879] [2021-11-03 04:35:44,094 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410007,410020] [2021-11-03 04:35:44,094 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410145,410158] [2021-11-03 04:35:44,095 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410303,410316] [2021-11-03 04:35:44,095 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410462,410475] [2021-11-03 04:35:44,096 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410618,410631] [2021-11-03 04:35:44,096 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410767,410780] [2021-11-03 04:35:44,096 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410919,410932] [2021-11-03 04:35:44,097 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411070,411083] [2021-11-03 04:35:44,097 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411219,411232] [2021-11-03 04:35:44,097 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411371,411384] [2021-11-03 04:35:44,098 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411519,411532] [2021-11-03 04:35:44,098 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411672,411685] [2021-11-03 04:35:44,098 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411823,411836] [2021-11-03 04:35:44,099 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411973,411986] [2021-11-03 04:35:44,099 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412120,412133] [2021-11-03 04:35:44,099 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412271,412284] [2021-11-03 04:35:44,100 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412422,412435] [2021-11-03 04:35:44,100 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412570,412583] [2021-11-03 04:35:44,100 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412736,412749] [2021-11-03 04:35:44,101 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412905,412918] [2021-11-03 04:35:44,101 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413072,413085] [2021-11-03 04:35:44,102 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413240,413253] [2021-11-03 04:35:44,102 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413390,413403] [2021-11-03 04:35:44,102 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413537,413550] [2021-11-03 04:35:44,103 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413698,413711] [2021-11-03 04:35:44,103 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413868,413881] [2021-11-03 04:35:44,104 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[414030,414043] [2021-11-03 04:35:44,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:35:44,146 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 04:35:44,413 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,414 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,414 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,415 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,418 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,419 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,420 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,420 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,420 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,421 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,421 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,422 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,423 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,423 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,423 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,424 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,424 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,424 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,424 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,425 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,425 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,425 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,426 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,427 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,427 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,427 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,428 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,428 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,429 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,429 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,429 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,430 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,430 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,430 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,430 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,431 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,432 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,432 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,432 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,433 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,434 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,434 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,436 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,437 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,437 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,437 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,438 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,438 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,438 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,439 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,439 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,440 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,440 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,440 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,441 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,441 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,441 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,442 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,443 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,443 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,443 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,444 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,444 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,445 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,446 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,448 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,449 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,452 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,453 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,455 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,456 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,457 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,457 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,457 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,463 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,464 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,464 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,464 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,466 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,466 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,466 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,467 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,468 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,468 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,468 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,468 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,469 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,469 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-03 04:35:44,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:35:44,662 INFO L208 MainTranslator]: Completed translation [2021-11-03 04:35:44,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:35:44 WrapperNode [2021-11-03 04:35:44,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 04:35:44,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 04:35:44,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 04:35:44,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 04:35:44,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:35:44" (1/1) ... [2021-11-03 04:35:44,762 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:35:44" (1/1) ... [2021-11-03 04:35:44,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 04:35:44,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 04:35:44,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 04:35:44,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 04:35:44,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:35:44" (1/1) ... [2021-11-03 04:35:44,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:35:44" (1/1) ... [2021-11-03 04:35:44,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:35:44" (1/1) ... [2021-11-03 04:35:44,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:35:44" (1/1) ... [2021-11-03 04:35:45,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:35:44" (1/1) ... [2021-11-03 04:35:45,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:35:44" (1/1) ... [2021-11-03 04:35:45,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:35:44" (1/1) ... [2021-11-03 04:35:45,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 04:35:45,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 04:35:45,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 04:35:45,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 04:35:45,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:35:44" (1/1) ... [2021-11-03 04:35:45,138 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:35:45,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:35:45,165 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-03 04:35:45,176 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-03 04:35:45,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 04:35:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-03 04:35:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-03 04:35:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-03 04:35:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 04:35:45,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 04:35:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure __cmpxchg_wrong_size [2021-11-03 04:35:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 04:35:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-03 04:35:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-03 04:35:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-03 04:35:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 04:35:46,966 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L9761: #t~ret860 := main_#res; [2021-11-03 04:35:46,966 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-03 04:35:46,967 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_11_returnLabel: main_#res := 0; [2021-11-03 04:35:46,981 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 04:35:46,981 INFO L299 CfgBuilder]: Removed 1678 assume(true) statements. [2021-11-03 04:35:46,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:35:46 BoogieIcfgContainer [2021-11-03 04:35:46,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 04:35:47,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 04:35:47,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 04:35:47,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 04:35:47,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:35:40" (1/3) ... [2021-11-03 04:35:47,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe9e6e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:35:47, skipping insertion in model container [2021-11-03 04:35:47,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:35:44" (2/3) ... [2021-11-03 04:35:47,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe9e6e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:35:47, skipping insertion in model container [2021-11-03 04:35:47,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:35:46" (3/3) ... [2021-11-03 04:35:47,026 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2021-11-03 04:35:47,031 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 04:35:47,032 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 112 error locations. [2021-11-03 04:35:47,087 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 04:35:47,095 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-03 04:35:47,096 INFO L340 AbstractCegarLoop]: Starting to check reachability of 112 error locations. [2021-11-03 04:35:47,147 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-03 04:35:47,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 04:35:47,155 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:35:47,155 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-03 04:35:47,156 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-03 04:35:47,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:35:47,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1114166620, now seen corresponding path program 1 times [2021-11-03 04:35:47,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:35:47,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30576916] [2021-11-03 04:35:47,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:35:47,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:35:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:35:47,714 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-03 04:35:47,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:35:47,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30576916] [2021-11-03 04:35:47,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30576916] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:35:47,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:35:47,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:35:47,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005580420] [2021-11-03 04:35:47,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:35:47,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:35:47,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:35:47,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:35:47,747 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-03 04:35:50,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:35:50,329 INFO L93 Difference]: Finished difference Result 2822 states and 3612 transitions. [2021-11-03 04:35:50,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:35:50,331 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-03 04:35:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:35:50,348 INFO L225 Difference]: With dead ends: 2822 [2021-11-03 04:35:50,349 INFO L226 Difference]: Without dead ends: 1328 [2021-11-03 04:35:50,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.47ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:35:50,359 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 1815 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 3016 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1833.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1815 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 3018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.28ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2340.39ms IncrementalHoareTripleChecker+Time [2021-11-03 04:35:50,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1815 Valid, 178 Invalid, 3018 Unknown, 0 Unchecked, 22.28ms Time], IncrementalHoareTripleChecker [2 Valid, 3016 Invalid, 0 Unknown, 0 Unchecked, 2340.39ms Time] [2021-11-03 04:35:50,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2021-11-03 04:35:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1328. [2021-11-03 04:35:50,453 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-03 04:35:50,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1500 transitions. [2021-11-03 04:35:50,458 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1500 transitions. Word has length 32 [2021-11-03 04:35:50,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:35:50,459 INFO L470 AbstractCegarLoop]: Abstraction has 1328 states and 1500 transitions. [2021-11-03 04:35:50,460 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-03 04:35:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1500 transitions. [2021-11-03 04:35:50,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-03 04:35:50,464 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:35:50,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] [2021-11-03 04:35:50,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 04:35:50,465 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-03 04:35:50,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:35:50,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1267414080, now seen corresponding path program 1 times [2021-11-03 04:35:50,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:35:50,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005000723] [2021-11-03 04:35:50,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:35:50,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:35:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:35:50,620 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-03 04:35:50,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:35:50,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005000723] [2021-11-03 04:35:50,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005000723] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:35:50,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:35:50,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:35:50,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200754550] [2021-11-03 04:35:50,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:35:50,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:35:50,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:35:50,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:35:50,624 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-03 04:35:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:35:52,878 INFO L93 Difference]: Finished difference Result 1328 states and 1500 transitions. [2021-11-03 04:35:52,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:35:52,878 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-03 04:35:52,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:35:52,884 INFO L225 Difference]: With dead ends: 1328 [2021-11-03 04:35:52,884 INFO L226 Difference]: Without dead ends: 1324 [2021-11-03 04:35:52,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.80ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:35:52,888 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1617 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 2838 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1752.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.08ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2136.01ms IncrementalHoareTripleChecker+Time [2021-11-03 04:35:52,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1617 Valid, 0 Invalid, 2840 Unknown, 0 Unchecked, 9.08ms Time], IncrementalHoareTripleChecker [2 Valid, 2838 Invalid, 0 Unknown, 0 Unchecked, 2136.01ms Time] [2021-11-03 04:35:52,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2021-11-03 04:35:52,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1324. [2021-11-03 04:35:52,928 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-03 04:35:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1496 transitions. [2021-11-03 04:35:52,932 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1496 transitions. Word has length 34 [2021-11-03 04:35:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:35:52,933 INFO L470 AbstractCegarLoop]: Abstraction has 1324 states and 1496 transitions. [2021-11-03 04:35:52,933 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-03 04:35:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1496 transitions. [2021-11-03 04:35:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-03 04:35:52,938 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:35:52,938 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-03 04:35:52,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 04:35:52,938 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-03 04:35:52,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:35:52,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1801578912, now seen corresponding path program 1 times [2021-11-03 04:35:52,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:35:52,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94923124] [2021-11-03 04:35:52,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:35:52,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:35:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:35:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:35:53,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:35:53,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94923124] [2021-11-03 04:35:53,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94923124] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:35:53,104 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:35:53,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:35:53,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938177250] [2021-11-03 04:35:53,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:35:53,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:35:53,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:35:53,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:35:53,106 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-03 04:35:56,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:35:56,957 INFO L93 Difference]: Finished difference Result 1938 states and 2168 transitions. [2021-11-03 04:35:56,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:35:56,957 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-03 04:35:56,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:35:56,964 INFO L225 Difference]: With dead ends: 1938 [2021-11-03 04:35:56,965 INFO L226 Difference]: Without dead ends: 1926 [2021-11-03 04:35:56,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.11ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:35:56,969 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2090 mSDsluCounter, 4194 mSDsCounter, 0 mSdLazyCounter, 6447 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2923.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2090 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.37ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 6447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3637.13ms IncrementalHoareTripleChecker+Time [2021-11-03 04:35:56,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2090 Valid, 0 Invalid, 6475 Unknown, 0 Unchecked, 17.37ms Time], IncrementalHoareTripleChecker [28 Valid, 6447 Invalid, 0 Unknown, 0 Unchecked, 3637.13ms Time] [2021-11-03 04:35:56,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2021-11-03 04:35:57,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1644. [2021-11-03 04:35:57,062 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-03 04:35:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 1861 transitions. [2021-11-03 04:35:57,067 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 1861 transitions. Word has length 36 [2021-11-03 04:35:57,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:35:57,068 INFO L470 AbstractCegarLoop]: Abstraction has 1644 states and 1861 transitions. [2021-11-03 04:35:57,068 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-03 04:35:57,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 1861 transitions. [2021-11-03 04:35:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-03 04:35:57,071 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:35:57,071 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-03 04:35:57,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 04:35:57,072 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-03 04:35:57,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:35:57,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1785631868, now seen corresponding path program 1 times [2021-11-03 04:35:57,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:35:57,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236288838] [2021-11-03 04:35:57,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:35:57,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:35:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:35:57,209 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-03 04:35:57,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:35:57,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236288838] [2021-11-03 04:35:57,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236288838] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:35:57,210 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:35:57,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:35:57,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227320829] [2021-11-03 04:35:57,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:35:57,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:35:57,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:35:57,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:35:57,212 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-03 04:35:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:35:59,311 INFO L93 Difference]: Finished difference Result 1644 states and 1861 transitions. [2021-11-03 04:35:59,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:35:59,312 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-03 04:35:59,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:35:59,317 INFO L225 Difference]: With dead ends: 1644 [2021-11-03 04:35:59,318 INFO L226 Difference]: Without dead ends: 1640 [2021-11-03 04:35:59,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.55ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:35:59,319 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1603 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 2838 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1595.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1603 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.92ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1993.85ms IncrementalHoareTripleChecker+Time [2021-11-03 04:35:59,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1603 Valid, 0 Invalid, 2840 Unknown, 0 Unchecked, 5.92ms Time], IncrementalHoareTripleChecker [2 Valid, 2838 Invalid, 0 Unknown, 0 Unchecked, 1993.85ms Time] [2021-11-03 04:35:59,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2021-11-03 04:35:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2021-11-03 04:35:59,364 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-03 04:35:59,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 1857 transitions. [2021-11-03 04:35:59,368 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 1857 transitions. Word has length 36 [2021-11-03 04:35:59,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:35:59,369 INFO L470 AbstractCegarLoop]: Abstraction has 1640 states and 1857 transitions. [2021-11-03 04:35:59,369 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-03 04:35:59,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1857 transitions. [2021-11-03 04:35:59,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-03 04:35:59,370 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:35:59,370 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-03 04:35:59,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 04:35:59,370 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-03 04:35:59,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:35:59,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1994842920, now seen corresponding path program 1 times [2021-11-03 04:35:59,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:35:59,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636884387] [2021-11-03 04:35:59,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:35:59,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:35:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:35:59,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-03 04:35:59,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:35:59,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636884387] [2021-11-03 04:35:59,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636884387] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:35:59,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:35:59,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:35:59,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940558712] [2021-11-03 04:35:59,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:35:59,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:35:59,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:35:59,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:35:59,513 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-03 04:36:01,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:01,397 INFO L93 Difference]: Finished difference Result 1640 states and 1857 transitions. [2021-11-03 04:36:01,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:36:01,397 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-03 04:36:01,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:01,403 INFO L225 Difference]: With dead ends: 1640 [2021-11-03 04:36:01,403 INFO L226 Difference]: Without dead ends: 1636 [2021-11-03 04:36:01,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.60ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:36:01,405 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1589 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 2838 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1472.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.65ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1811.11ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:01,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1589 Valid, 0 Invalid, 2840 Unknown, 0 Unchecked, 4.65ms Time], IncrementalHoareTripleChecker [2 Valid, 2838 Invalid, 0 Unknown, 0 Unchecked, 1811.11ms Time] [2021-11-03 04:36:01,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2021-11-03 04:36:01,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1636. [2021-11-03 04:36:01,458 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-03 04:36:01,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 1853 transitions. [2021-11-03 04:36:01,461 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 1853 transitions. Word has length 38 [2021-11-03 04:36:01,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:01,462 INFO L470 AbstractCegarLoop]: Abstraction has 1636 states and 1853 transitions. [2021-11-03 04:36:01,462 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-03 04:36:01,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 1853 transitions. [2021-11-03 04:36:01,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-03 04:36:01,464 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:01,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] [2021-11-03 04:36:01,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 04:36:01,465 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-03 04:36:01,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:01,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1488782124, now seen corresponding path program 1 times [2021-11-03 04:36:01,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:01,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132637107] [2021-11-03 04:36:01,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:01,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:01,583 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-03 04:36:01,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:01,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132637107] [2021-11-03 04:36:01,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132637107] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:36:01,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:36:01,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:36:01,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604141856] [2021-11-03 04:36:01,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:36:01,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:01,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:36:01,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:36:01,585 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-03 04:36:03,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:03,564 INFO L93 Difference]: Finished difference Result 1636 states and 1853 transitions. [2021-11-03 04:36:03,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:36:03,564 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-03 04:36:03,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:03,569 INFO L225 Difference]: With dead ends: 1636 [2021-11-03 04:36:03,569 INFO L226 Difference]: Without dead ends: 1632 [2021-11-03 04:36:03,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.90ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:36:03,570 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1575 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 2838 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1565.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1575 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.89ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1900.76ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:03,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1575 Valid, 0 Invalid, 2840 Unknown, 0 Unchecked, 4.89ms Time], IncrementalHoareTripleChecker [2 Valid, 2838 Invalid, 0 Unknown, 0 Unchecked, 1900.76ms Time] [2021-11-03 04:36:03,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2021-11-03 04:36:03,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1632. [2021-11-03 04:36:03,619 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-03 04:36:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 1849 transitions. [2021-11-03 04:36:03,623 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 1849 transitions. Word has length 40 [2021-11-03 04:36:03,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:03,624 INFO L470 AbstractCegarLoop]: Abstraction has 1632 states and 1849 transitions. [2021-11-03 04:36:03,624 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-03 04:36:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 1849 transitions. [2021-11-03 04:36:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-03 04:36:03,625 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:03,625 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-03 04:36:03,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 04:36:03,625 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-03 04:36:03,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:03,626 INFO L85 PathProgramCache]: Analyzing trace with hash 495661968, now seen corresponding path program 1 times [2021-11-03 04:36:03,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:03,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751720178] [2021-11-03 04:36:03,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:03,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:03,727 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-03 04:36:03,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:03,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751720178] [2021-11-03 04:36:03,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751720178] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:36:03,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:36:03,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:36:03,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742745385] [2021-11-03 04:36:03,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:36:03,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:03,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:36:03,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:36:03,731 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-03 04:36:05,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:05,685 INFO L93 Difference]: Finished difference Result 1632 states and 1849 transitions. [2021-11-03 04:36:05,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:36:05,685 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-03 04:36:05,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:05,691 INFO L225 Difference]: With dead ends: 1632 [2021-11-03 04:36:05,691 INFO L226 Difference]: Without dead ends: 1628 [2021-11-03 04:36:05,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.60ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:36:05,693 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1561 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 2838 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1526.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.83ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1866.74ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:05,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1561 Valid, 0 Invalid, 2840 Unknown, 0 Unchecked, 4.83ms Time], IncrementalHoareTripleChecker [2 Valid, 2838 Invalid, 0 Unknown, 0 Unchecked, 1866.74ms Time] [2021-11-03 04:36:05,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2021-11-03 04:36:05,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1628. [2021-11-03 04:36:05,744 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-03 04:36:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 1845 transitions. [2021-11-03 04:36:05,748 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 1845 transitions. Word has length 42 [2021-11-03 04:36:05,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:05,749 INFO L470 AbstractCegarLoop]: Abstraction has 1628 states and 1845 transitions. [2021-11-03 04:36:05,749 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-03 04:36:05,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1845 transitions. [2021-11-03 04:36:05,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-03 04:36:05,750 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:05,750 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-03 04:36:05,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 04:36:05,750 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-03 04:36:05,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:05,751 INFO L85 PathProgramCache]: Analyzing trace with hash -410067884, now seen corresponding path program 1 times [2021-11-03 04:36:05,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:05,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645032590] [2021-11-03 04:36:05,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:05,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:05,893 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-03 04:36:05,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:05,894 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645032590] [2021-11-03 04:36:05,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645032590] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:36:05,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:36:05,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:36:05,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713143041] [2021-11-03 04:36:05,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:36:05,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:05,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:36:05,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:36:05,895 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-03 04:36:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:07,948 INFO L93 Difference]: Finished difference Result 1628 states and 1845 transitions. [2021-11-03 04:36:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:36:07,948 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-03 04:36:07,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:07,954 INFO L225 Difference]: With dead ends: 1628 [2021-11-03 04:36:07,954 INFO L226 Difference]: Without dead ends: 1624 [2021-11-03 04:36:07,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.97ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:36:07,956 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1547 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 2838 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1614.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.50ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1971.45ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:07,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1547 Valid, 0 Invalid, 2840 Unknown, 0 Unchecked, 4.50ms Time], IncrementalHoareTripleChecker [2 Valid, 2838 Invalid, 0 Unknown, 0 Unchecked, 1971.45ms Time] [2021-11-03 04:36:07,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2021-11-03 04:36:08,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1624. [2021-11-03 04:36:08,008 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-03 04:36:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 1841 transitions. [2021-11-03 04:36:08,012 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 1841 transitions. Word has length 44 [2021-11-03 04:36:08,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:08,012 INFO L470 AbstractCegarLoop]: Abstraction has 1624 states and 1841 transitions. [2021-11-03 04:36:08,012 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-03 04:36:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1841 transitions. [2021-11-03 04:36:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-03 04:36:08,013 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:08,013 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-03 04:36:08,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 04:36:08,014 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-03 04:36:08,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:08,014 INFO L85 PathProgramCache]: Analyzing trace with hash -246411345, now seen corresponding path program 1 times [2021-11-03 04:36:08,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:08,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611543117] [2021-11-03 04:36:08,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:08,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:08,109 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-03 04:36:08,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:08,109 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611543117] [2021-11-03 04:36:08,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611543117] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:36:08,109 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:36:08,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:36:08,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683329452] [2021-11-03 04:36:08,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:36:08,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:08,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:36:08,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:36:08,112 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-03 04:36:10,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:10,911 INFO L93 Difference]: Finished difference Result 2351 states and 2661 transitions. [2021-11-03 04:36:10,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:36:10,912 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-03 04:36:10,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:10,918 INFO L225 Difference]: With dead ends: 2351 [2021-11-03 04:36:10,918 INFO L226 Difference]: Without dead ends: 2345 [2021-11-03 04:36:10,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.12ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:36:10,919 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2429 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 3560 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2100.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2429 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.53ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2620.61ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:10,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2429 Valid, 0 Invalid, 3576 Unknown, 0 Unchecked, 9.53ms Time], IncrementalHoareTripleChecker [16 Valid, 3560 Invalid, 0 Unknown, 0 Unchecked, 2620.61ms Time] [2021-11-03 04:36:10,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2021-11-03 04:36:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 1618. [2021-11-03 04:36:10,983 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-03 04:36:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 1835 transitions. [2021-11-03 04:36:10,987 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 1835 transitions. Word has length 46 [2021-11-03 04:36:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:10,988 INFO L470 AbstractCegarLoop]: Abstraction has 1618 states and 1835 transitions. [2021-11-03 04:36:10,988 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-03 04:36:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 1835 transitions. [2021-11-03 04:36:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-03 04:36:10,988 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:10,989 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-03 04:36:10,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 04:36:10,989 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-03 04:36:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:10,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1061905784, now seen corresponding path program 1 times [2021-11-03 04:36:10,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:10,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235260025] [2021-11-03 04:36:10,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:10,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:11,067 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-03 04:36:11,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:11,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235260025] [2021-11-03 04:36:11,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235260025] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:36:11,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:36:11,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:36:11,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989724624] [2021-11-03 04:36:11,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:36:11,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:11,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:36:11,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:36:11,070 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-03 04:36:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:12,968 INFO L93 Difference]: Finished difference Result 1618 states and 1835 transitions. [2021-11-03 04:36:12,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:36:12,969 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-03 04:36:12,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:12,973 INFO L225 Difference]: With dead ends: 1618 [2021-11-03 04:36:12,973 INFO L226 Difference]: Without dead ends: 1614 [2021-11-03 04:36:12,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.11ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:36:12,974 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1527 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 2826 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1445.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.78ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1799.96ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:12,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1527 Valid, 0 Invalid, 2828 Unknown, 0 Unchecked, 4.78ms Time], IncrementalHoareTripleChecker [2 Valid, 2826 Invalid, 0 Unknown, 0 Unchecked, 1799.96ms Time] [2021-11-03 04:36:12,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2021-11-03 04:36:13,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1614. [2021-11-03 04:36:13,038 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-03 04:36:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 1831 transitions. [2021-11-03 04:36:13,042 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 1831 transitions. Word has length 46 [2021-11-03 04:36:13,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:13,042 INFO L470 AbstractCegarLoop]: Abstraction has 1614 states and 1831 transitions. [2021-11-03 04:36:13,042 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-03 04:36:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 1831 transitions. [2021-11-03 04:36:13,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-03 04:36:13,043 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:13,043 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-03 04:36:13,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 04:36:13,044 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-03 04:36:13,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:13,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1710607589, now seen corresponding path program 1 times [2021-11-03 04:36:13,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:13,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091368419] [2021-11-03 04:36:13,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:13,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:13,131 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-03 04:36:13,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:13,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091368419] [2021-11-03 04:36:13,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091368419] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:36:13,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:36:13,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:36:13,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135474055] [2021-11-03 04:36:13,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:36:13,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:13,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:36:13,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:36:13,134 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-03 04:36:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:15,233 INFO L93 Difference]: Finished difference Result 1614 states and 1831 transitions. [2021-11-03 04:36:15,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:36:15,233 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-03 04:36:15,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:15,237 INFO L225 Difference]: With dead ends: 1614 [2021-11-03 04:36:15,238 INFO L226 Difference]: Without dead ends: 1610 [2021-11-03 04:36:15,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.09ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:36:15,239 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1513 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 2826 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1637.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.99ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1992.46ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:15,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1513 Valid, 0 Invalid, 2828 Unknown, 0 Unchecked, 4.99ms Time], IncrementalHoareTripleChecker [2 Valid, 2826 Invalid, 0 Unknown, 0 Unchecked, 1992.46ms Time] [2021-11-03 04:36:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2021-11-03 04:36:15,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1610. [2021-11-03 04:36:15,303 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-03 04:36:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 1827 transitions. [2021-11-03 04:36:15,307 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 1827 transitions. Word has length 48 [2021-11-03 04:36:15,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:15,307 INFO L470 AbstractCegarLoop]: Abstraction has 1610 states and 1827 transitions. [2021-11-03 04:36:15,307 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-03 04:36:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1827 transitions. [2021-11-03 04:36:15,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-03 04:36:15,308 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:15,308 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-03 04:36:15,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-03 04:36:15,309 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-03 04:36:15,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:15,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1078733087, now seen corresponding path program 1 times [2021-11-03 04:36:15,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:15,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044039120] [2021-11-03 04:36:15,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:15,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:15,384 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-03 04:36:15,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:15,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044039120] [2021-11-03 04:36:15,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044039120] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:36:15,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:36:15,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:36:15,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351987943] [2021-11-03 04:36:15,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:36:15,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:15,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:36:15,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:36:15,389 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-03 04:36:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:17,971 INFO L93 Difference]: Finished difference Result 2285 states and 2596 transitions. [2021-11-03 04:36:17,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:36:17,972 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-03 04:36:17,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:17,977 INFO L225 Difference]: With dead ends: 2285 [2021-11-03 04:36:17,977 INFO L226 Difference]: Without dead ends: 2281 [2021-11-03 04:36:17,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.21ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:36:17,978 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1541 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 3600 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1960.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.96ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2441.39ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:17,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1541 Valid, 0 Invalid, 3603 Unknown, 0 Unchecked, 5.96ms Time], IncrementalHoareTripleChecker [3 Valid, 3600 Invalid, 0 Unknown, 0 Unchecked, 2441.39ms Time] [2021-11-03 04:36:17,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2021-11-03 04:36:18,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 2145. [2021-11-03 04:36:18,065 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-03 04:36:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 2503 transitions. [2021-11-03 04:36:18,069 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 2503 transitions. Word has length 50 [2021-11-03 04:36:18,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:18,069 INFO L470 AbstractCegarLoop]: Abstraction has 2145 states and 2503 transitions. [2021-11-03 04:36:18,069 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-03 04:36:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2503 transitions. [2021-11-03 04:36:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-03 04:36:18,070 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:18,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] [2021-11-03 04:36:18,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-03 04:36:18,070 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-03 04:36:18,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:18,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1575530371, now seen corresponding path program 1 times [2021-11-03 04:36:18,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:18,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96791742] [2021-11-03 04:36:18,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:18,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:18,150 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-03 04:36:18,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:18,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96791742] [2021-11-03 04:36:18,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96791742] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:36:18,152 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:36:18,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:36:18,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707465513] [2021-11-03 04:36:18,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:36:18,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:18,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:36:18,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:36:18,153 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-03 04:36:20,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:20,807 INFO L93 Difference]: Finished difference Result 2806 states and 3234 transitions. [2021-11-03 04:36:20,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:36:20,807 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-03 04:36:20,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:20,814 INFO L225 Difference]: With dead ends: 2806 [2021-11-03 04:36:20,814 INFO L226 Difference]: Without dead ends: 2802 [2021-11-03 04:36:20,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.89ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:36:20,815 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 889 mSDsluCounter, 2483 mSDsCounter, 0 mSdLazyCounter, 3964 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2052.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.28ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2517.18ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:20,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [889 Valid, 0 Invalid, 3967 Unknown, 0 Unchecked, 5.28ms Time], IncrementalHoareTripleChecker [3 Valid, 3964 Invalid, 0 Unknown, 0 Unchecked, 2517.18ms Time] [2021-11-03 04:36:20,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2021-11-03 04:36:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2711. [2021-11-03 04:36:20,954 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-03 04:36:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3148 transitions. [2021-11-03 04:36:20,959 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3148 transitions. Word has length 52 [2021-11-03 04:36:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:20,960 INFO L470 AbstractCegarLoop]: Abstraction has 2711 states and 3148 transitions. [2021-11-03 04:36:20,960 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-03 04:36:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3148 transitions. [2021-11-03 04:36:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-03 04:36:20,961 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:20,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] [2021-11-03 04:36:20,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-03 04:36:20,961 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-03 04:36:20,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:20,962 INFO L85 PathProgramCache]: Analyzing trace with hash 54559857, now seen corresponding path program 1 times [2021-11-03 04:36:20,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:20,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130181743] [2021-11-03 04:36:20,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:20,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:21,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-03 04:36:21,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:21,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130181743] [2021-11-03 04:36:21,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130181743] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:36:21,037 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:36:21,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:36:21,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310745961] [2021-11-03 04:36:21,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:36:21,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:21,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:36:21,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:36:21,038 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-03 04:36:23,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:23,479 INFO L93 Difference]: Finished difference Result 5015 states and 5842 transitions. [2021-11-03 04:36:23,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:36:23,480 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-03 04:36:23,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:23,487 INFO L225 Difference]: With dead ends: 5015 [2021-11-03 04:36:23,487 INFO L226 Difference]: Without dead ends: 2839 [2021-11-03 04:36:23,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.54ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:36:23,489 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 149 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 2915 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1847.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.89ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2267.98ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:23,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 0 Invalid, 2915 Unknown, 0 Unchecked, 3.89ms Time], IncrementalHoareTripleChecker [0 Valid, 2915 Invalid, 0 Unknown, 0 Unchecked, 2267.98ms Time] [2021-11-03 04:36:23,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2021-11-03 04:36:23,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2712. [2021-11-03 04:36:23,576 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-03 04:36:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2712 states and 3149 transitions. [2021-11-03 04:36:23,582 INFO L78 Accepts]: Start accepts. Automaton has 2712 states and 3149 transitions. Word has length 53 [2021-11-03 04:36:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:23,582 INFO L470 AbstractCegarLoop]: Abstraction has 2712 states and 3149 transitions. [2021-11-03 04:36:23,582 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-03 04:36:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 3149 transitions. [2021-11-03 04:36:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-03 04:36:23,583 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:23,583 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-03 04:36:23,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-03 04:36:23,583 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-03 04:36:23,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:23,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2038616505, now seen corresponding path program 1 times [2021-11-03 04:36:23,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:23,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992342063] [2021-11-03 04:36:23,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:23,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:23,663 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-03 04:36:23,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:23,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992342063] [2021-11-03 04:36:23,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992342063] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:36:23,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:36:23,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:36:23,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530012649] [2021-11-03 04:36:23,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:36:23,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:23,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:36:23,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:36:23,665 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-03 04:36:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:25,701 INFO L93 Difference]: Finished difference Result 2712 states and 3149 transitions. [2021-11-03 04:36:25,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:36:25,702 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-03 04:36:25,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:25,709 INFO L225 Difference]: With dead ends: 2712 [2021-11-03 04:36:25,709 INFO L226 Difference]: Without dead ends: 2708 [2021-11-03 04:36:25,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.80ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:36:25,711 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1475 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 2834 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1519.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.34ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1902.56ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:25,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1475 Valid, 0 Invalid, 2836 Unknown, 0 Unchecked, 4.34ms Time], IncrementalHoareTripleChecker [2 Valid, 2834 Invalid, 0 Unknown, 0 Unchecked, 1902.56ms Time] [2021-11-03 04:36:25,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2021-11-03 04:36:25,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2708. [2021-11-03 04:36:25,825 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-03 04:36:25,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 3145 transitions. [2021-11-03 04:36:25,830 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 3145 transitions. Word has length 54 [2021-11-03 04:36:25,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:25,830 INFO L470 AbstractCegarLoop]: Abstraction has 2708 states and 3145 transitions. [2021-11-03 04:36:25,831 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-03 04:36:25,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3145 transitions. [2021-11-03 04:36:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-03 04:36:25,831 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:25,832 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-03 04:36:25,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-03 04:36:25,832 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-03 04:36:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash 377020572, now seen corresponding path program 1 times [2021-11-03 04:36:25,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:25,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335640125] [2021-11-03 04:36:25,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:25,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:26,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-03 04:36:26,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:26,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335640125] [2021-11-03 04:36:26,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335640125] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:36:26,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:36:26,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:36:26,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24264603] [2021-11-03 04:36:26,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:36:26,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:26,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:36:26,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:36:26,095 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-03 04:36:29,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:29,577 INFO L93 Difference]: Finished difference Result 6618 states and 7728 transitions. [2021-11-03 04:36:29,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:36:29,579 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-03 04:36:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:29,589 INFO L225 Difference]: With dead ends: 6618 [2021-11-03 04:36:29,590 INFO L226 Difference]: Without dead ends: 4259 [2021-11-03 04:36:29,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.17ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:36:29,595 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1033 mSDsluCounter, 2802 mSDsCounter, 0 mSdLazyCounter, 4498 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2611.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.24ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3241.41ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:29,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1033 Valid, 0 Invalid, 4499 Unknown, 0 Unchecked, 6.24ms Time], IncrementalHoareTripleChecker [1 Valid, 4498 Invalid, 0 Unknown, 0 Unchecked, 3241.41ms Time] [2021-11-03 04:36:29,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2021-11-03 04:36:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 2594. [2021-11-03 04:36:29,698 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-03 04:36:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 3010 transitions. [2021-11-03 04:36:29,702 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 3010 transitions. Word has length 54 [2021-11-03 04:36:29,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:29,702 INFO L470 AbstractCegarLoop]: Abstraction has 2594 states and 3010 transitions. [2021-11-03 04:36:29,702 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-03 04:36:29,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3010 transitions. [2021-11-03 04:36:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-03 04:36:29,703 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:29,704 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-03 04:36:29,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-03 04:36:29,704 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-03 04:36:29,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:29,705 INFO L85 PathProgramCache]: Analyzing trace with hash -605221525, now seen corresponding path program 1 times [2021-11-03 04:36:29,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:29,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338518249] [2021-11-03 04:36:29,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:29,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:29,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-03 04:36:29,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:29,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338518249] [2021-11-03 04:36:29,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338518249] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:36:29,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:36:29,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:36:29,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790156752] [2021-11-03 04:36:29,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:36:29,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:29,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:36:29,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:36:29,801 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-03 04:36:32,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:32,739 INFO L93 Difference]: Finished difference Result 2955 states and 3406 transitions. [2021-11-03 04:36:32,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:36:32,739 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-03 04:36:32,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:32,746 INFO L225 Difference]: With dead ends: 2955 [2021-11-03 04:36:32,747 INFO L226 Difference]: Without dead ends: 2951 [2021-11-03 04:36:32,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.41ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:36:32,748 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 615 mSDsluCounter, 2781 mSDsCounter, 0 mSdLazyCounter, 4278 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2243.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.47ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2757.00ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:32,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [615 Valid, 0 Invalid, 4282 Unknown, 0 Unchecked, 17.47ms Time], IncrementalHoareTripleChecker [4 Valid, 4278 Invalid, 0 Unknown, 0 Unchecked, 2757.00ms Time] [2021-11-03 04:36:32,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2021-11-03 04:36:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2871. [2021-11-03 04:36:32,864 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-03 04:36:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 3332 transitions. [2021-11-03 04:36:32,867 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 3332 transitions. Word has length 56 [2021-11-03 04:36:32,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:32,867 INFO L470 AbstractCegarLoop]: Abstraction has 2871 states and 3332 transitions. [2021-11-03 04:36:32,867 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-03 04:36:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 3332 transitions. [2021-11-03 04:36:32,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-03 04:36:32,868 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:32,868 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-03 04:36:32,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-03 04:36:32,868 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-03 04:36:32,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:32,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1940687920, now seen corresponding path program 1 times [2021-11-03 04:36:32,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:32,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196008095] [2021-11-03 04:36:32,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:32,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:32,946 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-03 04:36:32,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:32,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196008095] [2021-11-03 04:36:32,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196008095] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:36:32,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208299706] [2021-11-03 04:36:32,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:32,947 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:36:32,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:36:32,952 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-03 04:36:32,956 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-03 04:36:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:33,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-03 04:36:33,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:36:33,636 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-03 04:36:33,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:36:33,754 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-03 04:36:33,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208299706] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:36:33,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:36:33,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-03 04:36:33,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143007434] [2021-11-03 04:36:33,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 04:36:33,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:33,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 04:36:33,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:36:33,758 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-03 04:36:36,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:36,485 INFO L93 Difference]: Finished difference Result 5365 states and 6250 transitions. [2021-11-03 04:36:36,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:36:36,492 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-03 04:36:36,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:36,499 INFO L225 Difference]: With dead ends: 5365 [2021-11-03 04:36:36,500 INFO L226 Difference]: Without dead ends: 3255 [2021-11-03 04:36:36,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 15.59ms TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:36:36,505 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1329 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 3208 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1946.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.60ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2490.26ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:36,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1329 Valid, 0 Invalid, 3213 Unknown, 0 Unchecked, 6.60ms Time], IncrementalHoareTripleChecker [5 Valid, 3208 Invalid, 0 Unknown, 0 Unchecked, 2490.26ms Time] [2021-11-03 04:36:36,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2021-11-03 04:36:36,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 3171. [2021-11-03 04:36:36,655 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-03 04:36:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 3740 transitions. [2021-11-03 04:36:36,662 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 3740 transitions. Word has length 58 [2021-11-03 04:36:36,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:36,662 INFO L470 AbstractCegarLoop]: Abstraction has 3171 states and 3740 transitions. [2021-11-03 04:36:36,662 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-03 04:36:36,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 3740 transitions. [2021-11-03 04:36:36,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-03 04:36:36,663 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:36,663 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-03 04:36:36,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-03 04:36:36,863 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-03 04:36:36,864 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-03 04:36:36,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:36,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1797147409, now seen corresponding path program 1 times [2021-11-03 04:36:36,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:36,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156935221] [2021-11-03 04:36:36,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:36,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:36,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-03 04:36:36,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:36,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156935221] [2021-11-03 04:36:36,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156935221] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:36:36,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:36:36,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:36:36,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112636281] [2021-11-03 04:36:36,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:36:36,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:36,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:36:36,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:36:36,954 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-03 04:36:39,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:39,427 INFO L93 Difference]: Finished difference Result 3171 states and 3740 transitions. [2021-11-03 04:36:39,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:36:39,427 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-03 04:36:39,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:39,432 INFO L225 Difference]: With dead ends: 3171 [2021-11-03 04:36:39,432 INFO L226 Difference]: Without dead ends: 3167 [2021-11-03 04:36:39,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.34ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:36:39,433 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1451 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 2842 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1834.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1451 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.37ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2268.12ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:39,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1451 Valid, 0 Invalid, 2844 Unknown, 0 Unchecked, 5.37ms Time], IncrementalHoareTripleChecker [2 Valid, 2842 Invalid, 0 Unknown, 0 Unchecked, 2268.12ms Time] [2021-11-03 04:36:39,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3167 states. [2021-11-03 04:36:39,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3167 to 3167. [2021-11-03 04:36:39,552 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-03 04:36:39,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 3736 transitions. [2021-11-03 04:36:39,558 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 3736 transitions. Word has length 58 [2021-11-03 04:36:39,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:39,558 INFO L470 AbstractCegarLoop]: Abstraction has 3167 states and 3736 transitions. [2021-11-03 04:36:39,558 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-03 04:36:39,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 3736 transitions. [2021-11-03 04:36:39,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-03 04:36:39,559 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:39,559 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-03 04:36:39,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-03 04:36:39,560 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-03 04:36:39,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:39,570 INFO L85 PathProgramCache]: Analyzing trace with hash 17777306, now seen corresponding path program 1 times [2021-11-03 04:36:39,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:39,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385968610] [2021-11-03 04:36:39,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:39,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:39,661 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-03 04:36:39,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:39,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385968610] [2021-11-03 04:36:39,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385968610] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:36:39,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:36:39,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:36:39,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096464897] [2021-11-03 04:36:39,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:36:39,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:39,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:36:39,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:36:39,663 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-03 04:36:44,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:44,913 INFO L93 Difference]: Finished difference Result 5066 states and 5903 transitions. [2021-11-03 04:36:44,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:36:44,914 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-03 04:36:44,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:44,923 INFO L225 Difference]: With dead ends: 5066 [2021-11-03 04:36:44,923 INFO L226 Difference]: Without dead ends: 5058 [2021-11-03 04:36:44,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-03 04:36:44,926 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2301 mSDsluCounter, 3141 mSDsCounter, 0 mSdLazyCounter, 5874 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4014.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2301 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.97ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 5874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4905.19ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:44,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2301 Valid, 0 Invalid, 5889 Unknown, 0 Unchecked, 10.97ms Time], IncrementalHoareTripleChecker [15 Valid, 5874 Invalid, 0 Unknown, 0 Unchecked, 4905.19ms Time] [2021-11-03 04:36:44,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5058 states. [2021-11-03 04:36:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5058 to 3161. [2021-11-03 04:36:45,142 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-03 04:36:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 3719 transitions. [2021-11-03 04:36:45,146 INFO L78 Accepts]: Start accepts. Automaton has 3161 states and 3719 transitions. Word has length 59 [2021-11-03 04:36:45,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:45,146 INFO L470 AbstractCegarLoop]: Abstraction has 3161 states and 3719 transitions. [2021-11-03 04:36:45,147 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-03 04:36:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 3719 transitions. [2021-11-03 04:36:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-03 04:36:45,147 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:45,147 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-03 04:36:45,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-03 04:36:45,148 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-03 04:36:45,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:45,148 INFO L85 PathProgramCache]: Analyzing trace with hash -481653549, now seen corresponding path program 1 times [2021-11-03 04:36:45,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:45,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10594147] [2021-11-03 04:36:45,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:45,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:45,233 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-03 04:36:45,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:45,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10594147] [2021-11-03 04:36:45,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10594147] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:36:45,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:36:45,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:36:45,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229541983] [2021-11-03 04:36:45,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:36:45,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:45,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:36:45,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:36:45,236 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-03 04:36:47,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:47,908 INFO L93 Difference]: Finished difference Result 3161 states and 3719 transitions. [2021-11-03 04:36:47,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:36:47,908 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-03 04:36:47,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:47,913 INFO L225 Difference]: With dead ends: 3161 [2021-11-03 04:36:47,914 INFO L226 Difference]: Without dead ends: 3157 [2021-11-03 04:36:47,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.67ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:36:47,915 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1431 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1943.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1431 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.03ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2443.66ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:47,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1431 Valid, 0 Invalid, 2832 Unknown, 0 Unchecked, 6.03ms Time], IncrementalHoareTripleChecker [2 Valid, 2830 Invalid, 0 Unknown, 0 Unchecked, 2443.66ms Time] [2021-11-03 04:36:47,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3157 states. [2021-11-03 04:36:48,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3157 to 3157. [2021-11-03 04:36:48,103 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-03 04:36:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 3157 states and 3715 transitions. [2021-11-03 04:36:48,109 INFO L78 Accepts]: Start accepts. Automaton has 3157 states and 3715 transitions. Word has length 60 [2021-11-03 04:36:48,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:48,109 INFO L470 AbstractCegarLoop]: Abstraction has 3157 states and 3715 transitions. [2021-11-03 04:36:48,110 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-03 04:36:48,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3157 states and 3715 transitions. [2021-11-03 04:36:48,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-03 04:36:48,111 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:48,111 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-03 04:36:48,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-03 04:36:48,111 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-03 04:36:48,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:48,112 INFO L85 PathProgramCache]: Analyzing trace with hash -95745666, now seen corresponding path program 1 times [2021-11-03 04:36:48,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:48,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070255661] [2021-11-03 04:36:48,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:48,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:48,199 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-03 04:36:48,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:48,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070255661] [2021-11-03 04:36:48,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070255661] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:36:48,200 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:36:48,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:36:48,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198010807] [2021-11-03 04:36:48,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:36:48,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:48,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:36:48,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:36:48,203 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-03 04:36:51,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:51,885 INFO L93 Difference]: Finished difference Result 4962 states and 5806 transitions. [2021-11-03 04:36:51,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:36:51,886 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-03 04:36:51,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:51,894 INFO L225 Difference]: With dead ends: 4962 [2021-11-03 04:36:51,895 INFO L226 Difference]: Without dead ends: 4944 [2021-11-03 04:36:51,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.30ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:36:51,897 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2753 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 3657 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2695.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2753 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.31ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3330.27ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:51,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2753 Valid, 0 Invalid, 3677 Unknown, 0 Unchecked, 8.31ms Time], IncrementalHoareTripleChecker [20 Valid, 3657 Invalid, 0 Unknown, 0 Unchecked, 3330.27ms Time] [2021-11-03 04:36:51,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2021-11-03 04:36:52,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 3139. [2021-11-03 04:36:52,067 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-03 04:36:52,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 3679 transitions. [2021-11-03 04:36:52,072 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 3679 transitions. Word has length 61 [2021-11-03 04:36:52,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:52,073 INFO L470 AbstractCegarLoop]: Abstraction has 3139 states and 3679 transitions. [2021-11-03 04:36:52,073 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-03 04:36:52,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 3679 transitions. [2021-11-03 04:36:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-03 04:36:52,074 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:52,074 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-03 04:36:52,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-03 04:36:52,075 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-03 04:36:52,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:52,075 INFO L85 PathProgramCache]: Analyzing trace with hash 987561239, now seen corresponding path program 1 times [2021-11-03 04:36:52,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:52,075 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778938963] [2021-11-03 04:36:52,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:52,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:52,190 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-03 04:36:52,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:52,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778938963] [2021-11-03 04:36:52,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778938963] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:36:52,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:36:52,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:36:52,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669098235] [2021-11-03 04:36:52,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:36:52,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:52,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:36:52,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:36:52,192 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-03 04:36:54,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:54,545 INFO L93 Difference]: Finished difference Result 3139 states and 3679 transitions. [2021-11-03 04:36:54,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:36:54,546 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-03 04:36:54,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:54,550 INFO L225 Difference]: With dead ends: 3139 [2021-11-03 04:36:54,550 INFO L226 Difference]: Without dead ends: 3135 [2021-11-03 04:36:54,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.99ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:36:54,552 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1399 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 2794 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1678.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.64ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2119.45ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:54,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1399 Valid, 0 Invalid, 2796 Unknown, 0 Unchecked, 4.64ms Time], IncrementalHoareTripleChecker [2 Valid, 2794 Invalid, 0 Unknown, 0 Unchecked, 2119.45ms Time] [2021-11-03 04:36:54,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2021-11-03 04:36:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 3135. [2021-11-03 04:36:54,755 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-03 04:36:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 3675 transitions. [2021-11-03 04:36:54,761 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 3675 transitions. Word has length 62 [2021-11-03 04:36:54,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:54,761 INFO L470 AbstractCegarLoop]: Abstraction has 3135 states and 3675 transitions. [2021-11-03 04:36:54,761 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-03 04:36:54,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 3675 transitions. [2021-11-03 04:36:54,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-03 04:36:54,762 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:54,762 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-03 04:36:54,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-03 04:36:54,763 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-03 04:36:54,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:54,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1817139006, now seen corresponding path program 1 times [2021-11-03 04:36:54,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:54,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933617478] [2021-11-03 04:36:54,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:54,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:55,030 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-03 04:36:55,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:55,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933617478] [2021-11-03 04:36:55,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933617478] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:36:55,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:36:55,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 04:36:55,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438972840] [2021-11-03 04:36:55,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 04:36:55,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:55,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 04:36:55,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-03 04:36:55,032 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-03 04:36:59,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:36:59,066 INFO L93 Difference]: Finished difference Result 5244 states and 6104 transitions. [2021-11-03 04:36:59,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 04:36:59,066 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-03 04:36:59,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:36:59,093 INFO L225 Difference]: With dead ends: 5244 [2021-11-03 04:36:59,093 INFO L226 Difference]: Without dead ends: 2782 [2021-11-03 04:36:59,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 120.35ms TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-11-03 04:36:59,097 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1982 mSDsluCounter, 2888 mSDsCounter, 0 mSdLazyCounter, 4519 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2881.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1982 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.38ms SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 4519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3682.52ms IncrementalHoareTripleChecker+Time [2021-11-03 04:36:59,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1982 Valid, 0 Invalid, 4617 Unknown, 0 Unchecked, 10.38ms Time], IncrementalHoareTripleChecker [98 Valid, 4519 Invalid, 0 Unknown, 0 Unchecked, 3682.52ms Time] [2021-11-03 04:36:59,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2021-11-03 04:36:59,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 2446. [2021-11-03 04:36:59,235 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-03 04:36:59,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 2834 transitions. [2021-11-03 04:36:59,237 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 2834 transitions. Word has length 63 [2021-11-03 04:36:59,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:36:59,237 INFO L470 AbstractCegarLoop]: Abstraction has 2446 states and 2834 transitions. [2021-11-03 04:36:59,238 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-03 04:36:59,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 2834 transitions. [2021-11-03 04:36:59,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-03 04:36:59,238 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:36:59,238 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-03 04:36:59,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-03 04:36:59,239 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-03 04:36:59,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:36:59,239 INFO L85 PathProgramCache]: Analyzing trace with hash -141267525, now seen corresponding path program 1 times [2021-11-03 04:36:59,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:36:59,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927395294] [2021-11-03 04:36:59,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:36:59,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:36:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:36:59,321 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-03 04:36:59,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:36:59,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927395294] [2021-11-03 04:36:59,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927395294] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:36:59,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:36:59,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:36:59,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941411526] [2021-11-03 04:36:59,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:36:59,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:36:59,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:36:59,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:36:59,324 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-03 04:37:01,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:37:01,399 INFO L93 Difference]: Finished difference Result 2446 states and 2834 transitions. [2021-11-03 04:37:01,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:37:01,399 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-03 04:37:01,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:37:01,403 INFO L225 Difference]: With dead ends: 2446 [2021-11-03 04:37:01,403 INFO L226 Difference]: Without dead ends: 2442 [2021-11-03 04:37:01,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-03 04:37:01,405 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1194 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1440.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.29ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1870.63ms IncrementalHoareTripleChecker+Time [2021-11-03 04:37:01,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1194 Valid, 0 Invalid, 2414 Unknown, 0 Unchecked, 4.29ms Time], IncrementalHoareTripleChecker [2 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 1870.63ms Time] [2021-11-03 04:37:01,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2021-11-03 04:37:01,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2442. [2021-11-03 04:37:01,578 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-03 04:37:01,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 2830 transitions. [2021-11-03 04:37:01,582 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 2830 transitions. Word has length 64 [2021-11-03 04:37:01,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:37:01,583 INFO L470 AbstractCegarLoop]: Abstraction has 2442 states and 2830 transitions. [2021-11-03 04:37:01,583 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-03 04:37:01,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 2830 transitions. [2021-11-03 04:37:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-03 04:37:01,586 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:37:01,586 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-03 04:37:01,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-03 04:37:01,586 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-03 04:37:01,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:37:01,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1681016511, now seen corresponding path program 1 times [2021-11-03 04:37:01,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:37:01,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059706323] [2021-11-03 04:37:01,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:37:01,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:37:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:37:01,680 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-03 04:37:01,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:37:01,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059706323] [2021-11-03 04:37:01,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059706323] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:37:01,681 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:37:01,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:37:01,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51726984] [2021-11-03 04:37:01,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:37:01,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:37:01,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:37:01,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:37:01,682 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-03 04:37:03,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:37:03,827 INFO L93 Difference]: Finished difference Result 2442 states and 2830 transitions. [2021-11-03 04:37:03,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:37:03,828 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-03 04:37:03,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:37:03,832 INFO L225 Difference]: With dead ends: 2442 [2021-11-03 04:37:03,832 INFO L226 Difference]: Without dead ends: 2438 [2021-11-03 04:37:03,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.36ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:37:03,833 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1180 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1579.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.66ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1968.75ms IncrementalHoareTripleChecker+Time [2021-11-03 04:37:03,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1180 Valid, 0 Invalid, 2414 Unknown, 0 Unchecked, 3.66ms Time], IncrementalHoareTripleChecker [2 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 1968.75ms Time] [2021-11-03 04:37:03,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2438 states. [2021-11-03 04:37:03,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2438 to 2438. [2021-11-03 04:37:03,993 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-03 04:37:03,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 2826 transitions. [2021-11-03 04:37:03,995 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 2826 transitions. Word has length 66 [2021-11-03 04:37:03,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:37:03,996 INFO L470 AbstractCegarLoop]: Abstraction has 2438 states and 2826 transitions. [2021-11-03 04:37:03,996 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-03 04:37:03,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 2826 transitions. [2021-11-03 04:37:03,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-03 04:37:03,997 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:37:03,997 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-03 04:37:03,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-03 04:37:03,997 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-03 04:37:03,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:37:03,998 INFO L85 PathProgramCache]: Analyzing trace with hash 549318691, now seen corresponding path program 1 times [2021-11-03 04:37:03,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:37:03,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596724473] [2021-11-03 04:37:03,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:37:03,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:37:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:37:04,086 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-03 04:37:04,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:37:04,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596724473] [2021-11-03 04:37:04,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596724473] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:37:04,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:37:04,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:37:04,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368829260] [2021-11-03 04:37:04,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:37:04,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:37:04,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:37:04,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:37:04,089 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-03 04:37:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:37:06,582 INFO L93 Difference]: Finished difference Result 2438 states and 2826 transitions. [2021-11-03 04:37:06,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:37:06,583 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-03 04:37:06,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:37:06,586 INFO L225 Difference]: With dead ends: 2438 [2021-11-03 04:37:06,586 INFO L226 Difference]: Without dead ends: 2434 [2021-11-03 04:37:06,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.23ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:37:06,587 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1166 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1892.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.40ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2306.02ms IncrementalHoareTripleChecker+Time [2021-11-03 04:37:06,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1166 Valid, 0 Invalid, 2414 Unknown, 0 Unchecked, 3.40ms Time], IncrementalHoareTripleChecker [2 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2306.02ms Time] [2021-11-03 04:37:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2021-11-03 04:37:06,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2021-11-03 04:37:06,767 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-03 04:37:06,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 2822 transitions. [2021-11-03 04:37:06,771 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 2822 transitions. Word has length 68 [2021-11-03 04:37:06,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:37:06,772 INFO L470 AbstractCegarLoop]: Abstraction has 2434 states and 2822 transitions. [2021-11-03 04:37:06,772 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-03 04:37:06,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 2822 transitions. [2021-11-03 04:37:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-03 04:37:06,773 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:37:06,773 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-03 04:37:06,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-03 04:37:06,774 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-03 04:37:06,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:37:06,775 INFO L85 PathProgramCache]: Analyzing trace with hash -385560089, now seen corresponding path program 1 times [2021-11-03 04:37:06,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:37:06,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723762487] [2021-11-03 04:37:06,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:37:06,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:37:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:37:06,859 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-03 04:37:06,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:37:06,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723762487] [2021-11-03 04:37:06,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723762487] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:37:06,860 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:37:06,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:37:06,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078222075] [2021-11-03 04:37:06,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:37:06,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:37:06,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:37:06,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:37:06,861 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-03 04:37:09,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:37:09,014 INFO L93 Difference]: Finished difference Result 2434 states and 2822 transitions. [2021-11-03 04:37:09,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:37:09,015 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-03 04:37:09,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:37:09,018 INFO L225 Difference]: With dead ends: 2434 [2021-11-03 04:37:09,018 INFO L226 Difference]: Without dead ends: 2430 [2021-11-03 04:37:09,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.89ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:37:09,019 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1152 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1556.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.71ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1966.98ms IncrementalHoareTripleChecker+Time [2021-11-03 04:37:09,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1152 Valid, 0 Invalid, 2414 Unknown, 0 Unchecked, 3.71ms Time], IncrementalHoareTripleChecker [2 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 1966.98ms Time] [2021-11-03 04:37:09,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2021-11-03 04:37:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2430. [2021-11-03 04:37:09,221 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-03 04:37:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 2818 transitions. [2021-11-03 04:37:09,224 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 2818 transitions. Word has length 70 [2021-11-03 04:37:09,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:37:09,225 INFO L470 AbstractCegarLoop]: Abstraction has 2430 states and 2818 transitions. [2021-11-03 04:37:09,225 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-03 04:37:09,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 2818 transitions. [2021-11-03 04:37:09,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-03 04:37:09,226 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:37:09,226 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-03 04:37:09,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-03 04:37:09,227 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-03 04:37:09,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:37:09,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1155902453, now seen corresponding path program 1 times [2021-11-03 04:37:09,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:37:09,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588320242] [2021-11-03 04:37:09,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:37:09,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:37:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:37:09,312 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-03 04:37:09,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:37:09,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588320242] [2021-11-03 04:37:09,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588320242] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:37:09,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:37:09,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:37:09,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546814221] [2021-11-03 04:37:09,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:37:09,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:37:09,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:37:09,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:37:09,314 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-03 04:37:11,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:37:11,361 INFO L93 Difference]: Finished difference Result 2430 states and 2818 transitions. [2021-11-03 04:37:11,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:37:11,361 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-03 04:37:11,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:37:11,364 INFO L225 Difference]: With dead ends: 2430 [2021-11-03 04:37:11,364 INFO L226 Difference]: Without dead ends: 2331 [2021-11-03 04:37:11,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.13ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:37:11,365 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1138 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1415.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.72ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1854.73ms IncrementalHoareTripleChecker+Time [2021-11-03 04:37:11,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1138 Valid, 0 Invalid, 2414 Unknown, 0 Unchecked, 3.72ms Time], IncrementalHoareTripleChecker [2 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 1854.73ms Time] [2021-11-03 04:37:11,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2021-11-03 04:37:11,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 2331. [2021-11-03 04:37:11,497 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-03 04:37:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2331 states to 2331 states and 2713 transitions. [2021-11-03 04:37:11,500 INFO L78 Accepts]: Start accepts. Automaton has 2331 states and 2713 transitions. Word has length 72 [2021-11-03 04:37:11,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:37:11,500 INFO L470 AbstractCegarLoop]: Abstraction has 2331 states and 2713 transitions. [2021-11-03 04:37:11,500 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-03 04:37:11,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 2713 transitions. [2021-11-03 04:37:11,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-03 04:37:11,500 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:37:11,501 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-03 04:37:11,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-03 04:37:11,501 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-03 04:37:11,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:37:11,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1562532637, now seen corresponding path program 1 times [2021-11-03 04:37:11,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:37:11,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301922448] [2021-11-03 04:37:11,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:37:11,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:37:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:37:11,600 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-03 04:37:11,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:37:11,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301922448] [2021-11-03 04:37:11,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301922448] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:37:11,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332684146] [2021-11-03 04:37:11,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:37:11,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:37:11,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:37:11,603 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-03 04:37:11,604 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-03 04:37:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:37:12,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-03 04:37:12,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:37:12,224 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-03 04:37:12,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-03 04:37:12,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332684146] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:37:12,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-03 04:37:12,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-11-03 04:37:12,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945955152] [2021-11-03 04:37:12,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:37:12,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:37:12,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:37:12,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:37:12,226 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-03 04:37:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:37:16,531 INFO L93 Difference]: Finished difference Result 4154 states and 4763 transitions. [2021-11-03 04:37:16,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:37:16,532 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-03 04:37:16,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:37:16,536 INFO L225 Difference]: With dead ends: 4154 [2021-11-03 04:37:16,536 INFO L226 Difference]: Without dead ends: 4150 [2021-11-03 04:37:16,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 27.65ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-03 04:37:16,538 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2866 mSDsluCounter, 2030 mSDsCounter, 0 mSdLazyCounter, 4397 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3086.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2866 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.86ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3894.43ms IncrementalHoareTripleChecker+Time [2021-11-03 04:37:16,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2866 Valid, 0 Invalid, 4410 Unknown, 0 Unchecked, 10.86ms Time], IncrementalHoareTripleChecker [13 Valid, 4397 Invalid, 0 Unknown, 0 Unchecked, 3894.43ms Time] [2021-11-03 04:37:16,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4150 states. [2021-11-03 04:37:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4150 to 2327. [2021-11-03 04:37:16,779 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-03 04:37:16,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 2706 transitions. [2021-11-03 04:37:16,782 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 2706 transitions. Word has length 78 [2021-11-03 04:37:16,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:37:16,783 INFO L470 AbstractCegarLoop]: Abstraction has 2327 states and 2706 transitions. [2021-11-03 04:37:16,783 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-03 04:37:16,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 2706 transitions. [2021-11-03 04:37:16,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-03 04:37:16,784 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:37:16,785 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-03 04:37:16,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-03 04:37:16,994 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-03 04:37:16,994 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-03 04:37:16,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:37:16,995 INFO L85 PathProgramCache]: Analyzing trace with hash 62104588, now seen corresponding path program 1 times [2021-11-03 04:37:16,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:37:16,995 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103695469] [2021-11-03 04:37:16,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:37:16,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:37:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:37:17,116 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-03 04:37:17,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:37:17,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103695469] [2021-11-03 04:37:17,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103695469] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:37:17,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151328572] [2021-11-03 04:37:17,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:37:17,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:37:17,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:37:17,118 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-03 04:37:17,120 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-03 04:37:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:37:17,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 1489 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-03 04:37:17,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:37:17,842 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-03 04:37:17,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:37:18,102 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-03 04:37:18,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151328572] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:37:18,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:37:18,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2021-11-03 04:37:18,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061385820] [2021-11-03 04:37:18,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 04:37:18,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:37:18,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 04:37:18,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:37:18,104 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-03 04:37:22,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:37:22,183 INFO L93 Difference]: Finished difference Result 2339 states and 2712 transitions. [2021-11-03 04:37:22,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:37:22,184 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-03 04:37:22,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:37:22,186 INFO L225 Difference]: With dead ends: 2339 [2021-11-03 04:37:22,186 INFO L226 Difference]: Without dead ends: 2327 [2021-11-03 04:37:22,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 191 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 31.49ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-03 04:37:22,187 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2891 mSDsluCounter, 3484 mSDsCounter, 0 mSdLazyCounter, 5125 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3007.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2891 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.59ms SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 5125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3791.33ms IncrementalHoareTripleChecker+Time [2021-11-03 04:37:22,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2891 Valid, 0 Invalid, 5174 Unknown, 0 Unchecked, 12.59ms Time], IncrementalHoareTripleChecker [49 Valid, 5125 Invalid, 0 Unknown, 0 Unchecked, 3791.33ms Time] [2021-11-03 04:37:22,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2021-11-03 04:37:22,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 2250. [2021-11-03 04:37:22,373 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-03 04:37:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 2617 transitions. [2021-11-03 04:37:22,377 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 2617 transitions. Word has length 97 [2021-11-03 04:37:22,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:37:22,378 INFO L470 AbstractCegarLoop]: Abstraction has 2250 states and 2617 transitions. [2021-11-03 04:37:22,378 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-03 04:37:22,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 2617 transitions. [2021-11-03 04:37:22,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-03 04:37:22,381 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:37:22,381 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-03 04:37:22,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-03 04:37:22,600 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-03 04:37:22,600 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-03 04:37:22,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:37:22,601 INFO L85 PathProgramCache]: Analyzing trace with hash -276917568, now seen corresponding path program 1 times [2021-11-03 04:37:22,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:37:22,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756921504] [2021-11-03 04:37:22,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:37:22,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:37:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:37:22,741 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-03 04:37:22,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:37:22,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756921504] [2021-11-03 04:37:22,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756921504] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:37:22,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:37:22,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:37:22,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869945218] [2021-11-03 04:37:22,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:37:22,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:37:22,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:37:22,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:37:22,743 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-03 04:37:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:37:25,071 INFO L93 Difference]: Finished difference Result 2500 states and 2907 transitions. [2021-11-03 04:37:25,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:37:25,072 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-03 04:37:25,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:37:25,074 INFO L225 Difference]: With dead ends: 2500 [2021-11-03 04:37:25,075 INFO L226 Difference]: Without dead ends: 2486 [2021-11-03 04:37:25,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.60ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:37:25,076 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1481 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 2248 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1669.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.10ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2107.99ms IncrementalHoareTripleChecker+Time [2021-11-03 04:37:25,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1481 Valid, 0 Invalid, 2270 Unknown, 0 Unchecked, 4.10ms Time], IncrementalHoareTripleChecker [22 Valid, 2248 Invalid, 0 Unknown, 0 Unchecked, 2107.99ms Time] [2021-11-03 04:37:25,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2021-11-03 04:37:25,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2236. [2021-11-03 04:37:25,254 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-03 04:37:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2594 transitions. [2021-11-03 04:37:25,256 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2594 transitions. Word has length 120 [2021-11-03 04:37:25,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:37:25,257 INFO L470 AbstractCegarLoop]: Abstraction has 2236 states and 2594 transitions. [2021-11-03 04:37:25,257 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-03 04:37:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2594 transitions. [2021-11-03 04:37:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-03 04:37:25,259 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:37:25,259 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-03 04:37:25,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-03 04:37:25,260 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-03 04:37:25,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:37:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash 818410347, now seen corresponding path program 1 times [2021-11-03 04:37:25,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:37:25,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015714478] [2021-11-03 04:37:25,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:37:25,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:37:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:37:25,355 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-03 04:37:25,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:37:25,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015714478] [2021-11-03 04:37:25,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015714478] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:37:25,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:37:25,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:37:25,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482341316] [2021-11-03 04:37:25,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:37:25,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:37:25,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:37:25,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:37:25,358 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-03 04:37:30,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:37:30,057 INFO L93 Difference]: Finished difference Result 2766 states and 3216 transitions. [2021-11-03 04:37:30,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:37:30,058 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-03 04:37:30,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:37:30,061 INFO L225 Difference]: With dead ends: 2766 [2021-11-03 04:37:30,061 INFO L226 Difference]: Without dead ends: 2752 [2021-11-03 04:37:30,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.55ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:37:30,061 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 849 mSDsluCounter, 2246 mSDsCounter, 0 mSdLazyCounter, 3957 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3510.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.32ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4375.81ms IncrementalHoareTripleChecker+Time [2021-11-03 04:37:30,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [849 Valid, 0 Invalid, 3978 Unknown, 0 Unchecked, 8.32ms Time], IncrementalHoareTripleChecker [21 Valid, 3957 Invalid, 0 Unknown, 0 Unchecked, 4375.81ms Time] [2021-11-03 04:37:30,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2021-11-03 04:37:30,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2222. [2021-11-03 04:37:30,213 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-03 04:37:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 2571 transitions. [2021-11-03 04:37:30,216 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 2571 transitions. Word has length 128 [2021-11-03 04:37:30,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:37:30,216 INFO L470 AbstractCegarLoop]: Abstraction has 2222 states and 2571 transitions. [2021-11-03 04:37:30,216 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-03 04:37:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 2571 transitions. [2021-11-03 04:37:30,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-03 04:37:30,232 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:37:30,233 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-03 04:37:30,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-03 04:37:30,233 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-03 04:37:30,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:37:30,234 INFO L85 PathProgramCache]: Analyzing trace with hash 124270850, now seen corresponding path program 1 times [2021-11-03 04:37:30,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:37:30,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793260327] [2021-11-03 04:37:30,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:37:30,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:37:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:37:30,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-03 04:37:30,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:37:30,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793260327] [2021-11-03 04:37:30,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793260327] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:37:30,354 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:37:30,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 04:37:30,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128897998] [2021-11-03 04:37:30,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:37:30,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:37:30,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:37:30,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:37:30,355 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-03 04:37:37,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:37:37,536 INFO L93 Difference]: Finished difference Result 6538 states and 7648 transitions. [2021-11-03 04:37:37,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:37:37,537 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-03 04:37:37,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:37:37,543 INFO L225 Difference]: With dead ends: 6538 [2021-11-03 04:37:37,543 INFO L226 Difference]: Without dead ends: 5357 [2021-11-03 04:37:37,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.23ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:37:37,546 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3154 mSDsluCounter, 5081 mSDsCounter, 0 mSdLazyCounter, 7355 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5130.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3154 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.59ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 7355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6525.39ms IncrementalHoareTripleChecker+Time [2021-11-03 04:37:37,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3154 Valid, 0 Invalid, 7371 Unknown, 0 Unchecked, 17.59ms Time], IncrementalHoareTripleChecker [16 Valid, 7355 Invalid, 0 Unknown, 0 Unchecked, 6525.39ms Time] [2021-11-03 04:37:37,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5357 states. [2021-11-03 04:37:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5357 to 2249. [2021-11-03 04:37:37,754 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-03 04:37:37,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 2597 transitions. [2021-11-03 04:37:37,757 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 2597 transitions. Word has length 143 [2021-11-03 04:37:37,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:37:37,757 INFO L470 AbstractCegarLoop]: Abstraction has 2249 states and 2597 transitions. [2021-11-03 04:37:37,757 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-03 04:37:37,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 2597 transitions. [2021-11-03 04:37:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-03 04:37:37,759 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:37:37,759 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-03 04:37:37,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-03 04:37:37,760 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-03 04:37:37,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:37:37,760 INFO L85 PathProgramCache]: Analyzing trace with hash -268756160, now seen corresponding path program 1 times [2021-11-03 04:37:37,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:37:37,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734054464] [2021-11-03 04:37:37,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:37:37,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:37:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:37:37,915 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-03 04:37:37,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:37:37,916 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734054464] [2021-11-03 04:37:37,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734054464] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:37:37,916 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:37:37,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:37:37,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320952237] [2021-11-03 04:37:37,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:37:37,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:37:37,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:37:37,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:37:37,919 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-03 04:37:41,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:37:41,997 INFO L93 Difference]: Finished difference Result 3192 states and 3695 transitions. [2021-11-03 04:37:41,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:37:41,998 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-03 04:37:41,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:37:42,002 INFO L225 Difference]: With dead ends: 3192 [2021-11-03 04:37:42,002 INFO L226 Difference]: Without dead ends: 3190 [2021-11-03 04:37:42,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.70ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:37:42,003 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 993 mSDsluCounter, 2476 mSDsCounter, 0 mSdLazyCounter, 4167 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2873.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.30ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3676.35ms IncrementalHoareTripleChecker+Time [2021-11-03 04:37:42,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [993 Valid, 0 Invalid, 4173 Unknown, 0 Unchecked, 7.30ms Time], IncrementalHoareTripleChecker [6 Valid, 4167 Invalid, 0 Unknown, 0 Unchecked, 3676.35ms Time] [2021-11-03 04:37:42,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2021-11-03 04:37:42,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 2249. [2021-11-03 04:37:42,194 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-03 04:37:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 2595 transitions. [2021-11-03 04:37:42,197 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 2595 transitions. Word has length 143 [2021-11-03 04:37:42,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:37:42,197 INFO L470 AbstractCegarLoop]: Abstraction has 2249 states and 2595 transitions. [2021-11-03 04:37:42,197 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-03 04:37:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 2595 transitions. [2021-11-03 04:37:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-03 04:37:42,200 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:37:42,200 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-03 04:37:42,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-03 04:37:42,200 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-03 04:37:42,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:37:42,201 INFO L85 PathProgramCache]: Analyzing trace with hash -576382556, now seen corresponding path program 1 times [2021-11-03 04:37:42,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:37:42,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76641631] [2021-11-03 04:37:42,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:37:42,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:37:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:37:42,348 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-03 04:37:42,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:37:42,349 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76641631] [2021-11-03 04:37:42,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76641631] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:37:42,349 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:37:42,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:37:42,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725452253] [2021-11-03 04:37:42,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:37:42,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:37:42,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:37:42,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:37:42,351 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-03 04:37:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:37:45,564 INFO L93 Difference]: Finished difference Result 3201 states and 3711 transitions. [2021-11-03 04:37:45,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:37:45,564 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-03 04:37:45,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:37:45,567 INFO L225 Difference]: With dead ends: 3201 [2021-11-03 04:37:45,567 INFO L226 Difference]: Without dead ends: 2991 [2021-11-03 04:37:45,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.19ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:37:45,568 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1618 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 2595 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2214.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.07ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2835.62ms IncrementalHoareTripleChecker+Time [2021-11-03 04:37:45,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1618 Valid, 0 Invalid, 2607 Unknown, 0 Unchecked, 6.07ms Time], IncrementalHoareTripleChecker [12 Valid, 2595 Invalid, 0 Unknown, 0 Unchecked, 2835.62ms Time] [2021-11-03 04:37:45,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2021-11-03 04:37:45,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 2039. [2021-11-03 04:37:45,739 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-03 04:37:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 2358 transitions. [2021-11-03 04:37:45,742 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 2358 transitions. Word has length 145 [2021-11-03 04:37:45,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:37:45,742 INFO L470 AbstractCegarLoop]: Abstraction has 2039 states and 2358 transitions. [2021-11-03 04:37:45,743 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-03 04:37:45,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2358 transitions. [2021-11-03 04:37:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-03 04:37:45,744 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:37:45,745 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-03 04:37:45,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-03 04:37:45,745 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-03 04:37:45,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:37:45,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1455645263, now seen corresponding path program 1 times [2021-11-03 04:37:45,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:37:45,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458891400] [2021-11-03 04:37:45,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:37:45,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:37:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:37:46,158 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-03 04:37:46,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:37:46,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458891400] [2021-11-03 04:37:46,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458891400] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:37:46,159 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:37:46,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:37:46,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653296007] [2021-11-03 04:37:46,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:37:46,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:37:46,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:37:46,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:37:46,162 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-03 04:37:49,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:37:49,458 INFO L93 Difference]: Finished difference Result 4015 states and 4648 transitions. [2021-11-03 04:37:49,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:37:49,459 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-03 04:37:49,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:37:49,461 INFO L225 Difference]: With dead ends: 4015 [2021-11-03 04:37:49,461 INFO L226 Difference]: Without dead ends: 2039 [2021-11-03 04:37:49,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.22ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:37:49,464 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 3190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2253.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.50ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2994.95ms IncrementalHoareTripleChecker+Time [2021-11-03 04:37:49,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 3190 Unknown, 0 Unchecked, 5.50ms Time], IncrementalHoareTripleChecker [0 Valid, 3190 Invalid, 0 Unknown, 0 Unchecked, 2994.95ms Time] [2021-11-03 04:37:49,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2021-11-03 04:37:49,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2039. [2021-11-03 04:37:49,631 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-03 04:37:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 2355 transitions. [2021-11-03 04:37:49,634 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 2355 transitions. Word has length 163 [2021-11-03 04:37:49,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:37:49,634 INFO L470 AbstractCegarLoop]: Abstraction has 2039 states and 2355 transitions. [2021-11-03 04:37:49,634 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-03 04:37:49,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2355 transitions. [2021-11-03 04:37:49,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-11-03 04:37:49,636 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:37:49,636 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-03 04:37:49,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-03 04:37:49,636 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-03 04:37:49,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:37:49,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1894922186, now seen corresponding path program 1 times [2021-11-03 04:37:49,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:37:49,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691078625] [2021-11-03 04:37:49,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:37:49,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:37:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:37:50,101 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-03 04:37:50,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:37:50,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691078625] [2021-11-03 04:37:50,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691078625] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:37:50,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674994976] [2021-11-03 04:37:50,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:37:50,102 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:37:50,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:37:50,104 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-03 04:37:50,105 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-03 04:37:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:37:50,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 2140 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-03 04:37:50,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:37:51,243 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-03 04:37:51,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:37:51,792 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-03 04:37:51,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674994976] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:37:51,792 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:37:51,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-11-03 04:37:51,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079520968] [2021-11-03 04:37:51,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 04:37:51,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:37:51,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 04:37:51,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:37:51,794 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-03 04:37:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:37:56,074 INFO L93 Difference]: Finished difference Result 2927 states and 3399 transitions. [2021-11-03 04:37:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:37:56,074 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-03 04:37:56,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:37:56,077 INFO L225 Difference]: With dead ends: 2927 [2021-11-03 04:37:56,077 INFO L226 Difference]: Without dead ends: 2915 [2021-11-03 04:37:56,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 355 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 38.09ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-03 04:37:56,078 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2219 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 4095 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2965.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2219 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.72ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 4095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3858.75ms IncrementalHoareTripleChecker+Time [2021-11-03 04:37:56,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2219 Valid, 0 Invalid, 4118 Unknown, 0 Unchecked, 9.72ms Time], IncrementalHoareTripleChecker [23 Valid, 4095 Invalid, 0 Unknown, 0 Unchecked, 3858.75ms Time] [2021-11-03 04:37:56,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2021-11-03 04:37:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 2027. [2021-11-03 04:37:56,255 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-03 04:37:56,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2336 transitions. [2021-11-03 04:37:56,257 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2336 transitions. Word has length 181 [2021-11-03 04:37:56,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:37:56,258 INFO L470 AbstractCegarLoop]: Abstraction has 2027 states and 2336 transitions. [2021-11-03 04:37:56,258 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-03 04:37:56,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2336 transitions. [2021-11-03 04:37:56,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-11-03 04:37:56,259 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:37:56,259 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-03 04:37:56,281 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-03 04:37:56,460 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-03 04:37:56,460 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-03 04:37:56,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:37:56,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1722921435, now seen corresponding path program 1 times [2021-11-03 04:37:56,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:37:56,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388045784] [2021-11-03 04:37:56,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:37:56,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:37:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:37:56,827 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-03 04:37:56,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:37:56,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388045784] [2021-11-03 04:37:56,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388045784] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:37:56,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898675915] [2021-11-03 04:37:56,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:37:56,829 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:37:56,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:37:56,830 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-03 04:37:56,862 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-03 04:37:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:37:57,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 2114 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-03 04:37:57,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:37:57,903 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-03 04:37:57,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:37:58,348 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-03 04:37:58,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898675915] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:37:58,348 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:37:58,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-11-03 04:37:58,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531279787] [2021-11-03 04:37:58,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 04:37:58,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:37:58,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 04:37:58,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:37:58,350 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-03 04:38:02,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:38:02,069 INFO L93 Difference]: Finished difference Result 2027 states and 2336 transitions. [2021-11-03 04:38:02,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:38:02,070 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-03 04:38:02,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:38:02,073 INFO L225 Difference]: With dead ends: 2027 [2021-11-03 04:38:02,073 INFO L226 Difference]: Without dead ends: 1792 [2021-11-03 04:38:02,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 377 SyntacticMatches, 6 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.34ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:38:02,074 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 900 mSDsluCounter, 3184 mSDsCounter, 0 mSdLazyCounter, 4302 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2705.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.70ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3462.88ms IncrementalHoareTripleChecker+Time [2021-11-03 04:38:02,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [900 Valid, 0 Invalid, 4304 Unknown, 0 Unchecked, 6.70ms Time], IncrementalHoareTripleChecker [2 Valid, 4302 Invalid, 0 Unknown, 0 Unchecked, 3462.88ms Time] [2021-11-03 04:38:02,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2021-11-03 04:38:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1785. [2021-11-03 04:38:02,293 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-03 04:38:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2069 transitions. [2021-11-03 04:38:02,295 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2069 transitions. Word has length 192 [2021-11-03 04:38:02,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:38:02,295 INFO L470 AbstractCegarLoop]: Abstraction has 1785 states and 2069 transitions. [2021-11-03 04:38:02,296 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-03 04:38:02,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2069 transitions. [2021-11-03 04:38:02,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-11-03 04:38:02,297 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:38:02,297 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-03 04:38:02,323 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-03 04:38:02,511 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-03 04:38:02,512 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-03 04:38:02,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:38:02,512 INFO L85 PathProgramCache]: Analyzing trace with hash -766877368, now seen corresponding path program 1 times [2021-11-03 04:38:02,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:38:02,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752903578] [2021-11-03 04:38:02,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:38:02,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:38:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:38:02,589 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-03 04:38:02,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:38:02,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752903578] [2021-11-03 04:38:02,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752903578] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:38:02,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:38:02,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:38:02,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499041226] [2021-11-03 04:38:02,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:38:02,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:38:02,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:38:02,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:38:02,591 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-03 04:38:05,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:38:05,714 INFO L93 Difference]: Finished difference Result 5141 states and 5951 transitions. [2021-11-03 04:38:05,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:38:05,714 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-03 04:38:05,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:38:05,719 INFO L225 Difference]: With dead ends: 5141 [2021-11-03 04:38:05,719 INFO L226 Difference]: Without dead ends: 3415 [2021-11-03 04:38:05,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.58ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:38:05,722 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 959 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 2219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2094.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.86ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2724.44ms IncrementalHoareTripleChecker+Time [2021-11-03 04:38:05,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [959 Valid, 0 Invalid, 2220 Unknown, 0 Unchecked, 3.86ms Time], IncrementalHoareTripleChecker [1 Valid, 2219 Invalid, 0 Unknown, 0 Unchecked, 2724.44ms Time] [2021-11-03 04:38:05,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3415 states. [2021-11-03 04:38:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3415 to 1788. [2021-11-03 04:38:05,905 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-03 04:38:05,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2072 transitions. [2021-11-03 04:38:05,906 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2072 transitions. Word has length 194 [2021-11-03 04:38:05,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:38:05,907 INFO L470 AbstractCegarLoop]: Abstraction has 1788 states and 2072 transitions. [2021-11-03 04:38:05,907 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-03 04:38:05,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2072 transitions. [2021-11-03 04:38:05,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-11-03 04:38:05,908 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:38:05,908 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-03 04:38:05,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-03 04:38:05,908 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-03 04:38:05,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:38:05,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1714929334, now seen corresponding path program 1 times [2021-11-03 04:38:05,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:38:05,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507798451] [2021-11-03 04:38:05,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:38:05,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:38:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:38:06,030 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-03 04:38:06,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:38:06,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507798451] [2021-11-03 04:38:06,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507798451] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:38:06,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:38:06,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:38:06,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441230253] [2021-11-03 04:38:06,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:38:06,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:38:06,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:38:06,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:38:06,033 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-03 04:38:10,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:38:10,519 INFO L93 Difference]: Finished difference Result 4881 states and 5659 transitions. [2021-11-03 04:38:10,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:38:10,520 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-03 04:38:10,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:38:10,523 INFO L225 Difference]: With dead ends: 4881 [2021-11-03 04:38:10,523 INFO L226 Difference]: Without dead ends: 3152 [2021-11-03 04:38:10,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.66ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:38:10,525 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1855 mSDsluCounter, 2140 mSDsCounter, 0 mSdLazyCounter, 3246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3099.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1855 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.40ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4017.66ms IncrementalHoareTripleChecker+Time [2021-11-03 04:38:10,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1855 Valid, 0 Invalid, 3247 Unknown, 0 Unchecked, 8.40ms Time], IncrementalHoareTripleChecker [1 Valid, 3246 Invalid, 0 Unknown, 0 Unchecked, 4017.66ms Time] [2021-11-03 04:38:10,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3152 states. [2021-11-03 04:38:10,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3152 to 1766. [2021-11-03 04:38:10,719 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-03 04:38:10,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2037 transitions. [2021-11-03 04:38:10,720 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2037 transitions. Word has length 194 [2021-11-03 04:38:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:38:10,721 INFO L470 AbstractCegarLoop]: Abstraction has 1766 states and 2037 transitions. [2021-11-03 04:38:10,721 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-03 04:38:10,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2037 transitions. [2021-11-03 04:38:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-11-03 04:38:10,722 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:38:10,722 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-03 04:38:10,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-03 04:38:10,723 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-03 04:38:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:38:10,723 INFO L85 PathProgramCache]: Analyzing trace with hash 217813787, now seen corresponding path program 1 times [2021-11-03 04:38:10,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:38:10,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119280800] [2021-11-03 04:38:10,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:38:10,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:38:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:38:10,931 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-03 04:38:10,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:38:10,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119280800] [2021-11-03 04:38:10,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119280800] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:38:10,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:38:10,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 04:38:10,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447965215] [2021-11-03 04:38:10,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 04:38:10,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:38:10,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 04:38:10,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:38:10,934 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-03 04:38:17,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:38:17,941 INFO L93 Difference]: Finished difference Result 5722 states and 6653 transitions. [2021-11-03 04:38:17,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 04:38:17,942 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-03 04:38:17,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:38:17,965 INFO L225 Difference]: With dead ends: 5722 [2021-11-03 04:38:17,965 INFO L226 Difference]: Without dead ends: 4592 [2021-11-03 04:38:17,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 68.50ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-03 04:38:17,968 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3420 mSDsluCounter, 5620 mSDsCounter, 0 mSdLazyCounter, 6964 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4795.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3420 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.65ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 6964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6243.29ms IncrementalHoareTripleChecker+Time [2021-11-03 04:38:17,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3420 Valid, 0 Invalid, 6975 Unknown, 0 Unchecked, 17.65ms Time], IncrementalHoareTripleChecker [11 Valid, 6964 Invalid, 0 Unknown, 0 Unchecked, 6243.29ms Time] [2021-11-03 04:38:17,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4592 states. [2021-11-03 04:38:18,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4592 to 1784. [2021-11-03 04:38:18,167 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-03 04:38:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2055 transitions. [2021-11-03 04:38:18,168 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2055 transitions. Word has length 218 [2021-11-03 04:38:18,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:38:18,168 INFO L470 AbstractCegarLoop]: Abstraction has 1784 states and 2055 transitions. [2021-11-03 04:38:18,169 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-03 04:38:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2055 transitions. [2021-11-03 04:38:18,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2021-11-03 04:38:18,170 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:38:18,170 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-03 04:38:18,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-03 04:38:18,170 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-03 04:38:18,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:38:18,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1399097338, now seen corresponding path program 1 times [2021-11-03 04:38:18,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:38:18,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389805809] [2021-11-03 04:38:18,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:38:18,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:38:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:38:18,608 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-03 04:38:18,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:38:18,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389805809] [2021-11-03 04:38:18,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389805809] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:38:18,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717049283] [2021-11-03 04:38:18,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:38:18,609 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:38:18,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:38:18,610 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-03 04:38:18,612 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-03 04:38:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:38:19,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 2498 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-03 04:38:19,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:38:19,699 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-03 04:38:19,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-03 04:38:19,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717049283] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:38:19,700 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-03 04:38:19,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2021-11-03 04:38:19,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887841818] [2021-11-03 04:38:19,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:38:19,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:38:19,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:38:19,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-03 04:38:19,701 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-03 04:38:24,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:38:24,662 INFO L93 Difference]: Finished difference Result 2688 states and 3115 transitions. [2021-11-03 04:38:24,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:38:24,663 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-03 04:38:24,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:38:24,666 INFO L225 Difference]: With dead ends: 2688 [2021-11-03 04:38:24,666 INFO L226 Difference]: Without dead ends: 2676 [2021-11-03 04:38:24,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 151.64ms TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-11-03 04:38:24,667 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1491 mSDsluCounter, 2455 mSDsCounter, 0 mSdLazyCounter, 4103 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3449.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.27ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 4103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4436.34ms IncrementalHoareTripleChecker+Time [2021-11-03 04:38:24,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1491 Valid, 0 Invalid, 4129 Unknown, 0 Unchecked, 10.27ms Time], IncrementalHoareTripleChecker [26 Valid, 4103 Invalid, 0 Unknown, 0 Unchecked, 4436.34ms Time] [2021-11-03 04:38:24,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2021-11-03 04:38:24,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 1772. [2021-11-03 04:38:24,868 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-03 04:38:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2037 transitions. [2021-11-03 04:38:24,869 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2037 transitions. Word has length 220 [2021-11-03 04:38:24,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:38:24,870 INFO L470 AbstractCegarLoop]: Abstraction has 1772 states and 2037 transitions. [2021-11-03 04:38:24,870 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-03 04:38:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2037 transitions. [2021-11-03 04:38:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2021-11-03 04:38:24,872 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:38:24,872 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-03 04:38:24,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-03 04:38:25,072 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-03 04:38:25,073 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-03 04:38:25,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:38:25,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1337114123, now seen corresponding path program 1 times [2021-11-03 04:38:25,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:38:25,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481321989] [2021-11-03 04:38:25,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:38:25,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:38:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:38:25,248 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-03 04:38:25,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:38:25,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481321989] [2021-11-03 04:38:25,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481321989] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:38:25,249 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:38:25,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:38:25,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520814364] [2021-11-03 04:38:25,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:38:25,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:38:25,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:38:25,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:38:25,251 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-03 04:38:29,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:38:29,704 INFO L93 Difference]: Finished difference Result 2260 states and 2614 transitions. [2021-11-03 04:38:29,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:38:29,705 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-03 04:38:29,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:38:29,707 INFO L225 Difference]: With dead ends: 2260 [2021-11-03 04:38:29,707 INFO L226 Difference]: Without dead ends: 2254 [2021-11-03 04:38:29,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.12ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:38:29,708 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 808 mSDsluCounter, 2143 mSDsCounter, 0 mSdLazyCounter, 3766 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2990.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.97ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4039.41ms IncrementalHoareTripleChecker+Time [2021-11-03 04:38:29,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [808 Valid, 0 Invalid, 3779 Unknown, 0 Unchecked, 7.97ms Time], IncrementalHoareTripleChecker [13 Valid, 3766 Invalid, 0 Unknown, 0 Unchecked, 4039.41ms Time] [2021-11-03 04:38:29,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2021-11-03 04:38:29,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1766. [2021-11-03 04:38:29,919 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-03 04:38:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2028 transitions. [2021-11-03 04:38:29,921 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2028 transitions. Word has length 242 [2021-11-03 04:38:29,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:38:29,921 INFO L470 AbstractCegarLoop]: Abstraction has 1766 states and 2028 transitions. [2021-11-03 04:38:29,921 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-03 04:38:29,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2028 transitions. [2021-11-03 04:38:29,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2021-11-03 04:38:29,923 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:38:29,923 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-03 04:38:29,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-03 04:38:29,923 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-03 04:38:29,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:38:29,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1126999311, now seen corresponding path program 1 times [2021-11-03 04:38:29,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:38:29,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477457383] [2021-11-03 04:38:29,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:38:29,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:38:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:38:30,078 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-03 04:38:30,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:38:30,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477457383] [2021-11-03 04:38:30,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477457383] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:38:30,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:38:30,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:38:30,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747630100] [2021-11-03 04:38:30,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:38:30,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:38:30,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:38:30,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:38:30,080 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-03 04:38:33,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:38:33,515 INFO L93 Difference]: Finished difference Result 3512 states and 4064 transitions. [2021-11-03 04:38:33,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:38:33,515 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-03 04:38:33,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:38:33,518 INFO L225 Difference]: With dead ends: 3512 [2021-11-03 04:38:33,518 INFO L226 Difference]: Without dead ends: 2382 [2021-11-03 04:38:33,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.36ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:38:33,520 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 332 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 2244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2253.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.64ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3042.19ms IncrementalHoareTripleChecker+Time [2021-11-03 04:38:33,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 0 Invalid, 2244 Unknown, 0 Unchecked, 4.64ms Time], IncrementalHoareTripleChecker [0 Valid, 2244 Invalid, 0 Unknown, 0 Unchecked, 3042.19ms Time] [2021-11-03 04:38:33,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2021-11-03 04:38:33,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 1870. [2021-11-03 04:38:33,752 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-03 04:38:33,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2156 transitions. [2021-11-03 04:38:33,753 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2156 transitions. Word has length 247 [2021-11-03 04:38:33,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:38:33,754 INFO L470 AbstractCegarLoop]: Abstraction has 1870 states and 2156 transitions. [2021-11-03 04:38:33,754 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-03 04:38:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2156 transitions. [2021-11-03 04:38:33,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2021-11-03 04:38:33,755 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:38:33,755 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-03 04:38:33,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-03 04:38:33,756 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-03 04:38:33,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:38:33,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1650451, now seen corresponding path program 1 times [2021-11-03 04:38:33,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:38:33,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716319326] [2021-11-03 04:38:33,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:38:33,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:38:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:38:33,968 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-03 04:38:33,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:38:33,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716319326] [2021-11-03 04:38:33,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716319326] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:38:33,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:38:33,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:38:33,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084828215] [2021-11-03 04:38:33,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:38:33,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:38:33,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:38:33,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:38:33,970 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-03 04:38:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:38:38,295 INFO L93 Difference]: Finished difference Result 3670 states and 4269 transitions. [2021-11-03 04:38:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:38:38,296 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-03 04:38:38,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:38:38,298 INFO L225 Difference]: With dead ends: 3670 [2021-11-03 04:38:38,298 INFO L226 Difference]: Without dead ends: 2436 [2021-11-03 04:38:38,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 20.41ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-03 04:38:38,300 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2031 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 3785 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2895.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2031 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.51ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3853.02ms IncrementalHoareTripleChecker+Time [2021-11-03 04:38:38,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2031 Valid, 0 Invalid, 3786 Unknown, 0 Unchecked, 8.51ms Time], IncrementalHoareTripleChecker [1 Valid, 3785 Invalid, 0 Unknown, 0 Unchecked, 3853.02ms Time] [2021-11-03 04:38:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2021-11-03 04:38:38,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 1870. [2021-11-03 04:38:38,541 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-03 04:38:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2154 transitions. [2021-11-03 04:38:38,543 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2154 transitions. Word has length 250 [2021-11-03 04:38:38,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:38:38,543 INFO L470 AbstractCegarLoop]: Abstraction has 1870 states and 2154 transitions. [2021-11-03 04:38:38,543 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-03 04:38:38,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2154 transitions. [2021-11-03 04:38:38,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2021-11-03 04:38:38,545 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:38:38,545 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-03 04:38:38,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-03 04:38:38,545 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-03 04:38:38,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:38:38,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1710033, now seen corresponding path program 1 times [2021-11-03 04:38:38,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:38:38,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392043275] [2021-11-03 04:38:38,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:38:38,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:38:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:38:38,684 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-03 04:38:38,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:38:38,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392043275] [2021-11-03 04:38:38,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392043275] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:38:38,685 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:38:38,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:38:38,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586090734] [2021-11-03 04:38:38,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:38:38,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:38:38,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:38:38,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:38:38,687 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-03 04:38:42,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:38:42,839 INFO L93 Difference]: Finished difference Result 2439 states and 2821 transitions. [2021-11-03 04:38:42,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:38:42,840 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-03 04:38:42,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:38:42,842 INFO L225 Difference]: With dead ends: 2439 [2021-11-03 04:38:42,842 INFO L226 Difference]: Without dead ends: 2437 [2021-11-03 04:38:42,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.65ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:38:42,843 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1280 mSDsluCounter, 1989 mSDsCounter, 0 mSdLazyCounter, 3629 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2646.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.41ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3688.23ms IncrementalHoareTripleChecker+Time [2021-11-03 04:38:42,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1280 Valid, 0 Invalid, 3629 Unknown, 0 Unchecked, 8.41ms Time], IncrementalHoareTripleChecker [0 Valid, 3629 Invalid, 0 Unknown, 0 Unchecked, 3688.23ms Time] [2021-11-03 04:38:42,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2021-11-03 04:38:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1868. [2021-11-03 04:38:43,075 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-03 04:38:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2151 transitions. [2021-11-03 04:38:43,077 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2151 transitions. Word has length 250 [2021-11-03 04:38:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:38:43,077 INFO L470 AbstractCegarLoop]: Abstraction has 1868 states and 2151 transitions. [2021-11-03 04:38:43,077 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-03 04:38:43,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2151 transitions. [2021-11-03 04:38:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2021-11-03 04:38:43,079 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:38:43,079 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-03 04:38:43,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-03 04:38:43,079 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-03 04:38:43,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:38:43,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1851659248, now seen corresponding path program 1 times [2021-11-03 04:38:43,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:38:43,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444152477] [2021-11-03 04:38:43,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:38:43,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:38:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:38:43,498 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-03 04:38:43,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:38:43,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444152477] [2021-11-03 04:38:43,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444152477] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:38:43,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:38:43,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:38:43,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900767899] [2021-11-03 04:38:43,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:38:43,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:38:43,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:38:43,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:38:43,500 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-03 04:38:46,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:38:46,910 INFO L93 Difference]: Finished difference Result 1868 states and 2151 transitions. [2021-11-03 04:38:46,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:38:46,911 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-03 04:38:46,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:38:46,913 INFO L225 Difference]: With dead ends: 1868 [2021-11-03 04:38:46,913 INFO L226 Difference]: Without dead ends: 1736 [2021-11-03 04:38:46,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.70ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:38:46,914 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 811 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 3161 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2266.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.66ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 3161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3078.00ms IncrementalHoareTripleChecker+Time [2021-11-03 04:38:46,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [811 Valid, 0 Invalid, 3171 Unknown, 0 Unchecked, 5.66ms Time], IncrementalHoareTripleChecker [10 Valid, 3161 Invalid, 0 Unknown, 0 Unchecked, 3078.00ms Time] [2021-11-03 04:38:46,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2021-11-03 04:38:47,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1549. [2021-11-03 04:38:47,126 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-03 04:38:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 1798 transitions. [2021-11-03 04:38:47,127 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 1798 transitions. Word has length 250 [2021-11-03 04:38:47,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:38:47,128 INFO L470 AbstractCegarLoop]: Abstraction has 1549 states and 1798 transitions. [2021-11-03 04:38:47,128 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-03 04:38:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1798 transitions. [2021-11-03 04:38:47,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-11-03 04:38:47,129 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:38:47,129 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-03 04:38:47,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-03 04:38:47,130 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-03 04:38:47,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:38:47,130 INFO L85 PathProgramCache]: Analyzing trace with hash -589682853, now seen corresponding path program 1 times [2021-11-03 04:38:47,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:38:47,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669608112] [2021-11-03 04:38:47,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:38:47,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:38:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:38:47,315 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-03 04:38:47,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:38:47,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669608112] [2021-11-03 04:38:47,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669608112] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:38:47,316 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:38:47,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:38:47,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804906074] [2021-11-03 04:38:47,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:38:47,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:38:47,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:38:47,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:38:47,318 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-03 04:38:49,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:38:49,685 INFO L93 Difference]: Finished difference Result 2645 states and 3088 transitions. [2021-11-03 04:38:49,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:38:49,685 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-03 04:38:49,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:38:49,687 INFO L225 Difference]: With dead ends: 2645 [2021-11-03 04:38:49,687 INFO L226 Difference]: Without dead ends: 1545 [2021-11-03 04:38:49,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03 04:38:49,690 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 808 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1599.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.52ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2094.02ms IncrementalHoareTripleChecker+Time [2021-11-03 04:38:49,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [808 Valid, 0 Invalid, 1044 Unknown, 0 Unchecked, 1.52ms Time], IncrementalHoareTripleChecker [0 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 2094.02ms Time] [2021-11-03 04:38:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2021-11-03 04:38:49,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1545. [2021-11-03 04:38:49,899 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-03 04:38:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1791 transitions. [2021-11-03 04:38:49,900 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1791 transitions. Word has length 253 [2021-11-03 04:38:49,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:38:49,901 INFO L470 AbstractCegarLoop]: Abstraction has 1545 states and 1791 transitions. [2021-11-03 04:38:49,901 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-03 04:38:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1791 transitions. [2021-11-03 04:38:49,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2021-11-03 04:38:49,903 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:38:49,904 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-03 04:38:49,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-03 04:38:49,904 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-03 04:38:49,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:38:49,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1539343555, now seen corresponding path program 1 times [2021-11-03 04:38:49,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:38:49,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392271815] [2021-11-03 04:38:49,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:38:49,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:38:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:38:50,069 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-03 04:38:50,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:38:50,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392271815] [2021-11-03 04:38:50,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392271815] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:38:50,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:38:50,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:38:50,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933042476] [2021-11-03 04:38:50,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:38:50,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:38:50,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:38:50,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:38:50,071 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-03 04:38:53,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:38:53,599 INFO L93 Difference]: Finished difference Result 3533 states and 4135 transitions. [2021-11-03 04:38:53,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:38:53,599 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-03 04:38:53,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:38:53,602 INFO L225 Difference]: With dead ends: 3533 [2021-11-03 04:38:53,602 INFO L226 Difference]: Without dead ends: 2437 [2021-11-03 04:38:53,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.61ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:38:53,603 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 534 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2240.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.18ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3048.18ms IncrementalHoareTripleChecker+Time [2021-11-03 04:38:53,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 0 Invalid, 2578 Unknown, 0 Unchecked, 4.18ms Time], IncrementalHoareTripleChecker [1 Valid, 2577 Invalid, 0 Unknown, 0 Unchecked, 3048.18ms Time] [2021-11-03 04:38:53,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2021-11-03 04:38:53,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1547. [2021-11-03 04:38:53,808 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-03 04:38:53,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 1793 transitions. [2021-11-03 04:38:53,809 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 1793 transitions. Word has length 345 [2021-11-03 04:38:53,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:38:53,809 INFO L470 AbstractCegarLoop]: Abstraction has 1547 states and 1793 transitions. [2021-11-03 04:38:53,810 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-03 04:38:53,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1793 transitions. [2021-11-03 04:38:53,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2021-11-03 04:38:53,812 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:38:53,812 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-03 04:38:53,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-03 04:38:53,812 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-03 04:38:53,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:38:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash 396841089, now seen corresponding path program 1 times [2021-11-03 04:38:53,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:38:53,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648185302] [2021-11-03 04:38:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:38:53,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:38:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:38:54,064 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-03 04:38:54,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:38:54,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648185302] [2021-11-03 04:38:54,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648185302] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:38:54,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:38:54,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 04:38:54,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609797648] [2021-11-03 04:38:54,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 04:38:54,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:38:54,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 04:38:54,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-03 04:38:54,066 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-03 04:39:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:39:02,485 INFO L93 Difference]: Finished difference Result 4573 states and 5355 transitions. [2021-11-03 04:39:02,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 04:39:02,486 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-03 04:39:02,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:39:02,490 INFO L225 Difference]: With dead ends: 4573 [2021-11-03 04:39:02,490 INFO L226 Difference]: Without dead ends: 3475 [2021-11-03 04:39:02,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 91.92ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-03 04:39:02,492 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 6020 mSDsluCounter, 6824 mSDsCounter, 0 mSdLazyCounter, 8493 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5713.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6020 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.94ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7600.12ms IncrementalHoareTripleChecker+Time [2021-11-03 04:39:02,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6020 Valid, 0 Invalid, 8493 Unknown, 0 Unchecked, 19.94ms Time], IncrementalHoareTripleChecker [0 Valid, 8493 Invalid, 0 Unknown, 0 Unchecked, 7600.12ms Time] [2021-11-03 04:39:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3475 states. [2021-11-03 04:39:02,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3475 to 1559. [2021-11-03 04:39:02,744 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-03 04:39:02,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 1805 transitions. [2021-11-03 04:39:02,746 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 1805 transitions. Word has length 345 [2021-11-03 04:39:02,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:39:02,746 INFO L470 AbstractCegarLoop]: Abstraction has 1559 states and 1805 transitions. [2021-11-03 04:39:02,746 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-03 04:39:02,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1805 transitions. [2021-11-03 04:39:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2021-11-03 04:39:02,748 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:39:02,749 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-03 04:39:02,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-03 04:39:02,749 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-03 04:39:02,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:39:02,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1610548403, now seen corresponding path program 1 times [2021-11-03 04:39:02,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:39:02,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233186351] [2021-11-03 04:39:02,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:39:02,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:39:02,809 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 04:39:02,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1779642163] [2021-11-03 04:39:02,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:39:02,810 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:39:02,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:39:02,812 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-03 04:39:02,813 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-03 04:39:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:39:03,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 3475 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-03 04:39:03,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:39:04,187 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-03 04:39:04,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-03 04:39:04,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:39:04,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233186351] [2021-11-03 04:39:04,188 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 04:39:04,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779642163] [2021-11-03 04:39:04,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779642163] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:39:04,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:39:04,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 04:39:04,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471154950] [2021-11-03 04:39:04,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 04:39:04,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:39:04,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 04:39:04,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-03 04:39:04,189 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-03 04:39:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:39:12,880 INFO L93 Difference]: Finished difference Result 3732 states and 4354 transitions. [2021-11-03 04:39:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 04:39:12,880 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-03 04:39:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:39:12,884 INFO L225 Difference]: With dead ends: 3732 [2021-11-03 04:39:12,885 INFO L226 Difference]: Without dead ends: 3114 [2021-11-03 04:39:12,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 85.31ms TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-11-03 04:39:12,886 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 5457 mSDsluCounter, 6636 mSDsCounter, 0 mSdLazyCounter, 8632 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5891.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5457 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.99ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7824.96ms IncrementalHoareTripleChecker+Time [2021-11-03 04:39:12,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5457 Valid, 0 Invalid, 8637 Unknown, 0 Unchecked, 21.99ms Time], IncrementalHoareTripleChecker [5 Valid, 8632 Invalid, 0 Unknown, 0 Unchecked, 7824.96ms Time] [2021-11-03 04:39:12,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2021-11-03 04:39:13,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 1562. [2021-11-03 04:39:13,158 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-03 04:39:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 1808 transitions. [2021-11-03 04:39:13,160 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 1808 transitions. Word has length 351 [2021-11-03 04:39:13,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:39:13,160 INFO L470 AbstractCegarLoop]: Abstraction has 1562 states and 1808 transitions. [2021-11-03 04:39:13,160 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-03 04:39:13,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1808 transitions. [2021-11-03 04:39:13,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2021-11-03 04:39:13,162 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:39:13,163 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-03 04:39:13,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-03 04:39:13,363 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-03 04:39:13,364 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-03 04:39:13,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:39:13,364 INFO L85 PathProgramCache]: Analyzing trace with hash 91074321, now seen corresponding path program 1 times [2021-11-03 04:39:13,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:39:13,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193307604] [2021-11-03 04:39:13,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:39:13,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:39:13,429 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 04:39:13,429 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [96549144] [2021-11-03 04:39:13,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:39:13,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:39:13,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:39:13,431 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-03 04:39:13,432 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-03 04:39:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:39:15,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 3624 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-03 04:39:15,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:39:16,346 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-03 04:39:16,347 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-03 04:39:16,402 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-03 04:39:16,402 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-03 04:39:17,918 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-03 04:39:17,918 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-03 04:39:18,211 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-03 04:39:18,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:39:33,096 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-03 04:39:35,151 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-03 04:39:37,357 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-03 04:39:40,322 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-03 04:39:40,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:39:40,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193307604] [2021-11-03 04:39:40,322 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 04:39:40,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96549144] [2021-11-03 04:39:40,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96549144] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:39:40,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-03 04:39:40,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-11-03 04:39:40,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668254971] [2021-11-03 04:39:40,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-03 04:39:40,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:39:40,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-03 04:39:40,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=9, NotChecked=72, Total=240 [2021-11-03 04:39:40,325 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-03 04:39:43,910 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-03 04:39:46,207 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-03 04:39:48,240 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-03 04:39:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:39:53,077 INFO L93 Difference]: Finished difference Result 3036 states and 3527 transitions. [2021-11-03 04:39:53,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 04:39:53,082 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-03 04:39:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:39:53,084 INFO L225 Difference]: With dead ends: 3036 [2021-11-03 04:39:53,084 INFO L226 Difference]: Without dead ends: 1914 [2021-11-03 04:39:53,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 711 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 24518.91ms TimeCoverageRelationStatistics Valid=60, Invalid=162, Unknown=12, NotChecked=186, Total=420 [2021-11-03 04:39:53,086 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 340 mSDsluCounter, 8421 mSDsCounter, 0 mSdLazyCounter, 5249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4586.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 24.38ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5328 IncrementalHoareTripleChecker+Unchecked, 6019.94ms IncrementalHoareTripleChecker+Time [2021-11-03 04:39:53,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 0 Invalid, 10578 Unknown, 0 Unchecked, 24.38ms Time], IncrementalHoareTripleChecker [1 Valid, 5249 Invalid, 0 Unknown, 5328 Unchecked, 6019.94ms Time] [2021-11-03 04:39:53,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2021-11-03 04:39:53,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1862. [2021-11-03 04:39:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1861 states have (on average 1.1590542718968297) internal successors, (2157), 1861 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-03 04:39:53,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2157 transitions. [2021-11-03 04:39:53,414 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2157 transitions. Word has length 363 [2021-11-03 04:39:53,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:39:53,414 INFO L470 AbstractCegarLoop]: Abstraction has 1862 states and 2157 transitions. [2021-11-03 04:39:53,414 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-03 04:39:53,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2157 transitions. [2021-11-03 04:39:53,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2021-11-03 04:39:53,417 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:39:53,417 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-03 04:39:53,451 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-03 04:39:53,618 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-03 04:39:53,618 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-03 04:39:53,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:39:53,619 INFO L85 PathProgramCache]: Analyzing trace with hash -552621421, now seen corresponding path program 1 times [2021-11-03 04:39:53,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:39:53,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129264101] [2021-11-03 04:39:53,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:39:53,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:39:53,683 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 04:39:53,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1141019363] [2021-11-03 04:39:53,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:39:53,684 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:39:53,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:39:53,685 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-03 04:39:53,686 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-03 04:39:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:39:56,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 3623 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-03 04:39:56,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:39:56,809 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-03 04:39:56,809 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-03 04:39:56,865 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-03 04:39:56,865 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-03 04:39:58,135 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-03 04:39:58,136 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-03 04:39:58,384 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-03 04:39:58,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:40:13,238 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-03 04:40:15,273 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-03 04:40:17,444 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-03 04:40:19,658 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-03 04:40:19,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:40:19,658 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129264101] [2021-11-03 04:40:19,658 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 04:40:19,658 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141019363] [2021-11-03 04:40:19,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141019363] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:40:19,658 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-03 04:40:19,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-11-03 04:40:19,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389283850] [2021-11-03 04:40:19,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-03 04:40:19,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:40:19,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-03 04:40:19,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=9, NotChecked=72, Total=240 [2021-11-03 04:40:19,660 INFO L87 Difference]: Start difference. First operand 1862 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-03 04:40:22,796 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-03 04:40:25,211 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-03 04:40:27,268 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-03 04:40:33,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:40:33,586 INFO L93 Difference]: Finished difference Result 3338 states and 3866 transitions. [2021-11-03 04:40:33,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 04:40:33,587 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-03 04:40:33,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:40:33,589 INFO L225 Difference]: With dead ends: 3338 [2021-11-03 04:40:33,589 INFO L226 Difference]: Without dead ends: 2215 [2021-11-03 04:40:33,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 710 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 24520.19ms TimeCoverageRelationStatistics Valid=60, Invalid=162, Unknown=12, NotChecked=186, Total=420 [2021-11-03 04:40:33,591 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 145 mSDsluCounter, 8533 mSDsCounter, 0 mSdLazyCounter, 6287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5625.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.34ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4537 IncrementalHoareTripleChecker+Unchecked, 7133.67ms IncrementalHoareTripleChecker+Time [2021-11-03 04:40:33,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 0 Invalid, 10825 Unknown, 0 Unchecked, 20.34ms Time], IncrementalHoareTripleChecker [1 Valid, 6287 Invalid, 0 Unknown, 4537 Unchecked, 7133.67ms Time] [2021-11-03 04:40:33,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2021-11-03 04:40:33,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2028. [2021-11-03 04:40:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2028 states, 2027 states have (on average 1.1558954119388258) internal successors, (2343), 2027 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:40:33,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 2343 transitions. [2021-11-03 04:40:33,926 INFO L78 Accepts]: Start accepts. Automaton has 2028 states and 2343 transitions. Word has length 363 [2021-11-03 04:40:33,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:40:33,926 INFO L470 AbstractCegarLoop]: Abstraction has 2028 states and 2343 transitions. [2021-11-03 04:40:33,926 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-03 04:40:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2343 transitions. [2021-11-03 04:40:33,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2021-11-03 04:40:33,929 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:40:33,929 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-03 04:40:33,963 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-03 04:40:34,129 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-03 04:40:34,130 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-03 04:40:34,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:40:34,131 INFO L85 PathProgramCache]: Analyzing trace with hash -43842607, now seen corresponding path program 1 times [2021-11-03 04:40:34,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:40:34,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819311305] [2021-11-03 04:40:34,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:40:34,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:40:34,182 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 04:40:34,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2143191752] [2021-11-03 04:40:34,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:40:34,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:40:34,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:40:34,183 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-03 04:40:34,184 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-03 04:40:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:40:36,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 3620 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-03 04:40:36,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:40:37,585 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-03 04:40:37,585 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-03 04:40:37,639 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-03 04:40:37,640 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-03 04:40:38,892 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-03 04:40:38,893 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-03 04:40:39,166 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-03 04:40:39,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:40:54,032 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-03 04:40:56,075 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-03 04:40:58,290 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-03 04:41:01,023 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-03 04:41:01,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:41:01,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819311305] [2021-11-03 04:41:01,023 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 04:41:01,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143191752] [2021-11-03 04:41:01,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143191752] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:41:01,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-03 04:41:01,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-11-03 04:41:01,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785726604] [2021-11-03 04:41:01,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-03 04:41:01,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:41:01,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-03 04:41:01,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=9, NotChecked=72, Total=240 [2021-11-03 04:41:01,025 INFO L87 Difference]: Start difference. First operand 2028 states and 2343 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-03 04:41:04,525 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-03 04:41:06,859 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-03 04:41:08,909 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-03 04:41:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:41:15,780 INFO L93 Difference]: Finished difference Result 3350 states and 3880 transitions. [2021-11-03 04:41:15,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 04:41:15,781 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-03 04:41:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:41:15,783 INFO L225 Difference]: With dead ends: 3350 [2021-11-03 04:41:15,783 INFO L226 Difference]: Without dead ends: 2227 [2021-11-03 04:41:15,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 710 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 24554.58ms TimeCoverageRelationStatistics Valid=60, Invalid=162, Unknown=12, NotChecked=186, Total=420 [2021-11-03 04:41:15,785 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 145 mSDsluCounter, 8516 mSDsCounter, 0 mSdLazyCounter, 6291 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6251.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.63ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4475 IncrementalHoareTripleChecker+Unchecked, 8007.05ms IncrementalHoareTripleChecker+Time [2021-11-03 04:41:15,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 0 Invalid, 10767 Unknown, 0 Unchecked, 19.63ms Time], IncrementalHoareTripleChecker [1 Valid, 6291 Invalid, 0 Unknown, 4475 Unchecked, 8007.05ms Time] [2021-11-03 04:41:15,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2021-11-03 04:41:16,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2028. [2021-11-03 04:41:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2028 states, 2027 states have (on average 1.1558954119388258) internal successors, (2343), 2027 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:41:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 2343 transitions. [2021-11-03 04:41:16,128 INFO L78 Accepts]: Start accepts. Automaton has 2028 states and 2343 transitions. Word has length 363 [2021-11-03 04:41:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:41:16,128 INFO L470 AbstractCegarLoop]: Abstraction has 2028 states and 2343 transitions. [2021-11-03 04:41:16,128 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-03 04:41:16,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2343 transitions. [2021-11-03 04:41:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2021-11-03 04:41:16,131 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:41:16,131 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-03 04:41:16,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-03 04:41:16,331 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-03 04:41:16,332 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-03 04:41:16,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:41:16,332 INFO L85 PathProgramCache]: Analyzing trace with hash -135326130, now seen corresponding path program 1 times [2021-11-03 04:41:16,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:41:16,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774108069] [2021-11-03 04:41:16,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:41:16,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:41:16,392 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 04:41:16,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210309074] [2021-11-03 04:41:16,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:41:16,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:41:16,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:41:16,394 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-03 04:41:16,395 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-03 04:41:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:41:18,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 3629 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-03 04:41:18,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:41:19,554 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-03 04:41:19,554 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-03 04:41:19,610 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-03 04:41:19,610 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-03 04:41:20,908 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-03 04:41:20,908 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-03 04:41:21,179 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-03 04:41:21,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:41:36,044 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-03 04:41:38,078 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-03 04:41:40,269 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-03 04:41:44,129 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-03 04:41:44,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:41:44,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774108069] [2021-11-03 04:41:44,130 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 04:41:44,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210309074] [2021-11-03 04:41:44,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210309074] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:41:44,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-03 04:41:44,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-11-03 04:41:44,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400141554] [2021-11-03 04:41:44,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-03 04:41:44,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:41:44,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-03 04:41:44,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=9, NotChecked=72, Total=240 [2021-11-03 04:41:44,132 INFO L87 Difference]: Start difference. First operand 2028 states and 2343 transitions. Second operand has 16 states, 16 states have (on average 35.625) internal successors, (570), 15 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:41:47,055 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-03 04:41:49,289 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-03 04:41:51,330 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-03 04:41:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:41:55,338 INFO L93 Difference]: Finished difference Result 3276 states and 3802 transitions. [2021-11-03 04:41:55,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 04:41:55,339 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 35.625) internal successors, (570), 15 states have internal predecessors, (570), 0 states have call successors, (0), 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-03 04:41:55,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:41:55,341 INFO L225 Difference]: With dead ends: 3276 [2021-11-03 04:41:55,341 INFO L226 Difference]: Without dead ends: 2154 [2021-11-03 04:41:55,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 711 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 24597.52ms TimeCoverageRelationStatistics Valid=60, Invalid=162, Unknown=12, NotChecked=186, Total=420 [2021-11-03 04:41:55,343 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 6735 mSDsCounter, 0 mSdLazyCounter, 3958 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3299.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.26ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4659 IncrementalHoareTripleChecker+Unchecked, 4486.45ms IncrementalHoareTripleChecker+Time [2021-11-03 04:41:55,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 0 Invalid, 8617 Unknown, 0 Unchecked, 13.26ms Time], IncrementalHoareTripleChecker [0 Valid, 3958 Invalid, 0 Unknown, 4659 Unchecked, 4486.45ms Time] [2021-11-03 04:41:55,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2021-11-03 04:41:55,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2140. [2021-11-03 04:41:55,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.1538101916783543) internal successors, (2468), 2139 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:41:55,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2468 transitions. [2021-11-03 04:41:55,725 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2468 transitions. Word has length 364 [2021-11-03 04:41:55,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:41:55,725 INFO L470 AbstractCegarLoop]: Abstraction has 2140 states and 2468 transitions. [2021-11-03 04:41:55,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 35.625) internal successors, (570), 15 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:41:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2468 transitions. [2021-11-03 04:41:55,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2021-11-03 04:41:55,728 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:41:55,728 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-03 04:41:55,763 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-03 04:41:55,928 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,SelfDestructingSolverStorable55 [2021-11-03 04:41:55,929 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-03 04:41:55,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:41:55,930 INFO L85 PathProgramCache]: Analyzing trace with hash 373452684, now seen corresponding path program 1 times [2021-11-03 04:41:55,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:41:55,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913441121] [2021-11-03 04:41:55,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:41:55,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:41:55,984 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 04:41:55,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210964254] [2021-11-03 04:41:55,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:41:55,985 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:41:55,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:41:55,986 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-03 04:41:55,987 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-03 04:41:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:41:57,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 3626 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-03 04:41:57,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:41:58,368 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-03 04:41:58,368 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-03 04:41:58,428 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-03 04:41:58,429 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-03 04:41:59,788 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-03 04:41:59,788 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-03 04:42:00,053 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-03 04:42:00,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:42:14,946 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-03 04:42:17,024 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-03 04:42:19,320 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-03 04:42:23,344 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-03 04:42:23,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:42:23,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913441121] [2021-11-03 04:42:23,344 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 04:42:23,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210964254] [2021-11-03 04:42:23,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210964254] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:42:23,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-03 04:42:23,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-11-03 04:42:23,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074049749] [2021-11-03 04:42:23,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-03 04:42:23,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:42:23,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-03 04:42:23,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=9, NotChecked=72, Total=240 [2021-11-03 04:42:23,346 INFO L87 Difference]: Start difference. First operand 2140 states and 2468 transitions. Second operand has 16 states, 16 states have (on average 35.625) internal successors, (570), 15 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:42:28,542 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-03 04:42:31,105 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-03 04:42:33,213 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-03 04:42:41,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:42:41,091 INFO L93 Difference]: Finished difference Result 3466 states and 4010 transitions. [2021-11-03 04:42:41,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 04:42:41,092 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 35.625) internal successors, (570), 15 states have internal predecessors, (570), 0 states have call successors, (0), 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-03 04:42:41,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:42:41,094 INFO L225 Difference]: With dead ends: 3466 [2021-11-03 04:42:41,094 INFO L226 Difference]: Without dead ends: 2343 [2021-11-03 04:42:41,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 713 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 24655.45ms TimeCoverageRelationStatistics Valid=60, Invalid=162, Unknown=12, NotChecked=186, Total=420 [2021-11-03 04:42:41,096 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 11195 mSDsCounter, 0 mSdLazyCounter, 8248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8801.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 13665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.68ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5416 IncrementalHoareTripleChecker+Unchecked, 10934.10ms IncrementalHoareTripleChecker+Time [2021-11-03 04:42:41,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 13665 Unknown, 0 Unchecked, 22.68ms Time], IncrementalHoareTripleChecker [1 Valid, 8248 Invalid, 0 Unknown, 5416 Unchecked, 10934.10ms Time] [2021-11-03 04:42:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2021-11-03 04:42:41,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2141. [2021-11-03 04:42:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2141 states, 2140 states have (on average 1.1537383177570093) internal successors, (2469), 2140 states have internal predecessors, (2469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:42:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 2469 transitions. [2021-11-03 04:42:41,451 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 2469 transitions. Word has length 364 [2021-11-03 04:42:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:42:41,451 INFO L470 AbstractCegarLoop]: Abstraction has 2141 states and 2469 transitions. [2021-11-03 04:42:41,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 35.625) internal successors, (570), 15 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:42:41,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 2469 transitions. [2021-11-03 04:42:41,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2021-11-03 04:42:41,454 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:42:41,454 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-03 04:42:41,487 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-03 04:42:41,655 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,SelfDestructingSolverStorable56 [2021-11-03 04:42:41,656 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-03 04:42:41,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:42:41,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1808909911, now seen corresponding path program 1 times [2021-11-03 04:42:41,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:42:41,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496347357] [2021-11-03 04:42:41,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:42:41,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:42:41,703 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 04:42:41,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2006389902] [2021-11-03 04:42:41,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:42:41,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:42:41,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:42:41,704 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-03 04:42:41,705 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-03 04:42:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:42:42,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 3648 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-03 04:42:42,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:42:43,077 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-03 04:42:43,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-03 04:42:43,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:42:43,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496347357] [2021-11-03 04:42:43,078 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 04:42:43,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006389902] [2021-11-03 04:42:43,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006389902] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:42:43,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:42:43,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-03 04:42:43,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612032364] [2021-11-03 04:42:43,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-03 04:42:43,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:42:43,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-03 04:42:43,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-03 04:42:43,080 INFO L87 Difference]: Start difference. First operand 2141 states and 2469 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-03 04:42:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:42:53,823 INFO L93 Difference]: Finished difference Result 3665 states and 4234 transitions. [2021-11-03 04:42:53,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 04:42:53,823 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-03 04:42:53,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:42:53,826 INFO L225 Difference]: With dead ends: 3665 [2021-11-03 04:42:53,826 INFO L226 Difference]: Without dead ends: 2133 [2021-11-03 04:42:53,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 155.43ms TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2021-11-03 04:42:53,828 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 10220 mSDsCounter, 0 mSdLazyCounter, 11493 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7464.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 11505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.49ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 11493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10081.12ms IncrementalHoareTripleChecker+Time [2021-11-03 04:42:53,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 11505 Unknown, 0 Unchecked, 18.49ms Time], IncrementalHoareTripleChecker [12 Valid, 11493 Invalid, 0 Unknown, 0 Unchecked, 10081.12ms Time] [2021-11-03 04:42:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2021-11-03 04:42:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 2133. [2021-11-03 04:42:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 2132 states have (on average 1.151500938086304) internal successors, (2455), 2132 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:42:54,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2455 transitions. [2021-11-03 04:42:54,184 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2455 transitions. Word has length 364 [2021-11-03 04:42:54,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:42:54,185 INFO L470 AbstractCegarLoop]: Abstraction has 2133 states and 2455 transitions. [2021-11-03 04:42:54,185 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-03 04:42:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2455 transitions. [2021-11-03 04:42:54,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2021-11-03 04:42:54,187 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:42:54,188 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-03 04:42:54,210 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-03 04:42:54,388 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,SelfDestructingSolverStorable57 [2021-11-03 04:42:54,389 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-03 04:42:54,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:42:54,389 INFO L85 PathProgramCache]: Analyzing trace with hash -526644535, now seen corresponding path program 1 times [2021-11-03 04:42:54,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:42:54,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739685769] [2021-11-03 04:42:54,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:42:54,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:42:54,436 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 04:42:54,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [807754916] [2021-11-03 04:42:54,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:42:54,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:42:54,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:42:54,437 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-03 04:42:54,438 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-03 04:42:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:42:56,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 3656 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-03 04:42:56,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:42:56,854 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-03 04:42:56,854 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-03 04:42:56,911 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-03 04:42:56,912 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-03 04:42:58,129 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-03 04:42:58,129 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-03 04:42:58,402 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-03 04:42:58,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:43:13,219 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-03 04:43:15,274 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-03 04:43:17,496 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-03 04:43:21,018 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-03 04:43:21,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:43:21,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739685769] [2021-11-03 04:43:21,019 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 04:43:21,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807754916] [2021-11-03 04:43:21,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807754916] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:43:21,019 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-03 04:43:21,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-11-03 04:43:21,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13401698] [2021-11-03 04:43:21,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-03 04:43:21,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:43:21,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-03 04:43:21,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=9, NotChecked=72, Total=240 [2021-11-03 04:43:21,020 INFO L87 Difference]: Start difference. First operand 2133 states and 2455 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-03 04:43:24,587 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-03 04:43:26,862 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-03 04:43:28,904 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-03 04:43:36,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:43:36,956 INFO L93 Difference]: Finished difference Result 3584 states and 4162 transitions. [2021-11-03 04:43:36,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 04:43:36,957 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-03 04:43:36,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:43:36,960 INFO L225 Difference]: With dead ends: 3584 [2021-11-03 04:43:36,960 INFO L226 Difference]: Without dead ends: 2461 [2021-11-03 04:43:36,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 715 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 24613.61ms TimeCoverageRelationStatistics Valid=60, Invalid=162, Unknown=12, NotChecked=186, Total=420 [2021-11-03 04:43:36,961 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 12194 mSDsCounter, 0 mSdLazyCounter, 8395 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6833.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 15299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.03ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6903 IncrementalHoareTripleChecker+Unchecked, 9100.20ms IncrementalHoareTripleChecker+Time [2021-11-03 04:43:36,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 15299 Unknown, 0 Unchecked, 22.03ms Time], IncrementalHoareTripleChecker [1 Valid, 8395 Invalid, 0 Unknown, 6903 Unchecked, 9100.20ms Time] [2021-11-03 04:43:36,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2021-11-03 04:43:37,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2348. [2021-11-03 04:43:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2348 states, 2347 states have (on average 1.1589262888794205) internal successors, (2720), 2347 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:43:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 2720 transitions. [2021-11-03 04:43:37,354 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 2720 transitions. Word has length 365 [2021-11-03 04:43:37,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:43:37,354 INFO L470 AbstractCegarLoop]: Abstraction has 2348 states and 2720 transitions. [2021-11-03 04:43:37,354 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-03 04:43:37,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 2720 transitions. [2021-11-03 04:43:37,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2021-11-03 04:43:37,357 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:43:37,357 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-03 04:43:37,388 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-03 04:43:37,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:43:37,558 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-03 04:43:37,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:43:37,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1057265780, now seen corresponding path program 1 times [2021-11-03 04:43:37,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:43:37,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57903204] [2021-11-03 04:43:37,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:43:37,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:43:37,608 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 04:43:37,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1605330905] [2021-11-03 04:43:37,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:43:37,609 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:43:37,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:43:37,610 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-03 04:43:37,612 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-03 04:43:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:43:39,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 3633 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-03 04:43:39,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:43:40,278 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-03 04:43:40,279 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-03 04:43:40,338 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-03 04:43:40,338 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-03 04:43:41,544 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-03 04:43:41,545 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-03 04:43:41,807 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-03 04:43:41,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:43:56,664 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-03 04:43:58,718 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-03 04:44:01,059 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-03 04:44:05,335 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-03 04:44:05,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:44:05,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57903204] [2021-11-03 04:44:05,335 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 04:44:05,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605330905] [2021-11-03 04:44:05,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605330905] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:44:05,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-03 04:44:05,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-11-03 04:44:05,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652653109] [2021-11-03 04:44:05,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-03 04:44:05,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:44:05,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-03 04:44:05,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=9, NotChecked=72, Total=240 [2021-11-03 04:44:05,337 INFO L87 Difference]: Start difference. First operand 2348 states and 2720 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-03 04:44:08,622 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-03 04:44:10,937 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-03 04:44:12,981 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-03 04:44:20,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:44:20,788 INFO L93 Difference]: Finished difference Result 3749 states and 4367 transitions. [2021-11-03 04:44:20,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 04:44:20,789 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-03 04:44:20,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:44:20,792 INFO L225 Difference]: With dead ends: 3749 [2021-11-03 04:44:20,792 INFO L226 Difference]: Without dead ends: 2627 [2021-11-03 04:44:20,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 715 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 24512.76ms TimeCoverageRelationStatistics Valid=60, Invalid=162, Unknown=12, NotChecked=186, Total=420 [2021-11-03 04:44:20,794 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 297 mSDsluCounter, 10445 mSDsCounter, 0 mSdLazyCounter, 5348 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6685.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 12996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.31ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7646 IncrementalHoareTripleChecker+Unchecked, 8696.33ms IncrementalHoareTripleChecker+Time [2021-11-03 04:44:20,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 0 Invalid, 12996 Unknown, 0 Unchecked, 21.31ms Time], IncrementalHoareTripleChecker [2 Valid, 5348 Invalid, 0 Unknown, 7646 Unchecked, 8696.33ms Time] [2021-11-03 04:44:20,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2021-11-03 04:44:21,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2555. [2021-11-03 04:44:21,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2554 states have (on average 1.1656225528582616) internal successors, (2977), 2554 states have internal predecessors, (2977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:44:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 2977 transitions. [2021-11-03 04:44:21,230 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 2977 transitions. Word has length 365 [2021-11-03 04:44:21,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:44:21,230 INFO L470 AbstractCegarLoop]: Abstraction has 2555 states and 2977 transitions. [2021-11-03 04:44:21,230 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-03 04:44:21,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 2977 transitions. [2021-11-03 04:44:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2021-11-03 04:44:21,234 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:44:21,234 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-03 04:44:21,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-03 04:44:21,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2021-11-03 04:44:21,435 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-03 04:44:21,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:44:21,435 INFO L85 PathProgramCache]: Analyzing trace with hash 659203700, now seen corresponding path program 1 times [2021-11-03 04:44:21,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:44:21,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605273719] [2021-11-03 04:44:21,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:44:21,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:44:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:44:21,670 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-03 04:44:21,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:44:21,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605273719] [2021-11-03 04:44:21,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605273719] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:44:21,671 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:44:21,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:44:21,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069198706] [2021-11-03 04:44:21,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:44:21,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:44:21,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:44:21,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:44:21,672 INFO L87 Difference]: Start difference. First operand 2555 states and 2977 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-03 04:44:28,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:44:28,465 INFO L93 Difference]: Finished difference Result 4571 states and 5421 transitions. [2021-11-03 04:44:28,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:44:28,468 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-03 04:44:28,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:44:28,471 INFO L225 Difference]: With dead ends: 4571 [2021-11-03 04:44:28,471 INFO L226 Difference]: Without dead ends: 2904 [2021-11-03 04:44:28,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.88ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:44:28,473 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 402 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 2845 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4433.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.16ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6068.38ms IncrementalHoareTripleChecker+Time [2021-11-03 04:44:28,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 0 Invalid, 2860 Unknown, 0 Unchecked, 8.16ms Time], IncrementalHoareTripleChecker [15 Valid, 2845 Invalid, 0 Unknown, 0 Unchecked, 6068.38ms Time] [2021-11-03 04:44:28,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2021-11-03 04:44:28,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 2681. [2021-11-03 04:44:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2681 states, 2680 states have (on average 1.1753731343283582) internal successors, (3150), 2680 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:44:28,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 3150 transitions. [2021-11-03 04:44:28,931 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 3150 transitions. Word has length 365 [2021-11-03 04:44:28,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:44:28,931 INFO L470 AbstractCegarLoop]: Abstraction has 2681 states and 3150 transitions. [2021-11-03 04:44:28,932 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-03 04:44:28,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 3150 transitions. [2021-11-03 04:44:28,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2021-11-03 04:44:28,935 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:44:28,935 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-03 04:44:28,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-11-03 04:44:28,935 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-03 04:44:28,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:44:28,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1640158514, now seen corresponding path program 1 times [2021-11-03 04:44:28,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:44:28,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062261331] [2021-11-03 04:44:28,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:44:28,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:44:28,983 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 04:44:28,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37628873] [2021-11-03 04:44:28,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:44:28,983 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:44:28,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:44:28,984 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-03 04:44:28,985 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-03 04:44:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:44:30,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 3626 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-03 04:44:30,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:44:31,780 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-03 04:44:31,780 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-03 04:44:31,845 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-03 04:44:31,846 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-03 04:44:33,361 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-03 04:44:33,362 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-03 04:44:33,673 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-03 04:44:33,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:44:48,553 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-03 04:44:50,656 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-03 04:44:53,039 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-03 04:44:56,096 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-03 04:44:56,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:44:56,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062261331] [2021-11-03 04:44:56,096 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 04:44:56,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37628873] [2021-11-03 04:44:56,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37628873] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:44:56,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-03 04:44:56,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-11-03 04:44:56,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221845971] [2021-11-03 04:44:56,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-03 04:44:56,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:44:56,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-03 04:44:56,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=9, NotChecked=72, Total=240 [2021-11-03 04:44:56,097 INFO L87 Difference]: Start difference. First operand 2681 states and 3150 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-03 04:44:59,522 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-03 04:45:01,929 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-03 04:45:04,009 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-03 04:45:09,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:45:09,606 INFO L93 Difference]: Finished difference Result 4339 states and 5098 transitions. [2021-11-03 04:45:09,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 04:45:09,606 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-03 04:45:09,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:45:09,609 INFO L225 Difference]: With dead ends: 4339 [2021-11-03 04:45:09,609 INFO L226 Difference]: Without dead ends: 3151 [2021-11-03 04:45:09,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 715 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 24723.87ms TimeCoverageRelationStatistics Valid=60, Invalid=162, Unknown=12, NotChecked=186, Total=420 [2021-11-03 04:45:09,612 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 603 mSDsluCounter, 11141 mSDsCounter, 0 mSdLazyCounter, 5270 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4984.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.63ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9505 IncrementalHoareTripleChecker+Unchecked, 6576.23ms IncrementalHoareTripleChecker+Time [2021-11-03 04:45:09,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [603 Valid, 0 Invalid, 14777 Unknown, 0 Unchecked, 17.63ms Time], IncrementalHoareTripleChecker [2 Valid, 5270 Invalid, 0 Unknown, 9505 Unchecked, 6576.23ms Time] [2021-11-03 04:45:09,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2021-11-03 04:45:10,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 2844. [2021-11-03 04:45:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 2843 states have (on average 1.18220189940204) internal successors, (3361), 2843 states have internal predecessors, (3361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:45:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 3361 transitions. [2021-11-03 04:45:10,105 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 3361 transitions. Word has length 365 [2021-11-03 04:45:10,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:45:10,105 INFO L470 AbstractCegarLoop]: Abstraction has 2844 states and 3361 transitions. [2021-11-03 04:45:10,106 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-03 04:45:10,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 3361 transitions. [2021-11-03 04:45:10,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2021-11-03 04:45:10,109 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:45:10,110 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:45:10,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-03 04:45:10,310 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-03 04:45:10,310 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-03 04:45:10,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:45:10,311 INFO L85 PathProgramCache]: Analyzing trace with hash -384022632, now seen corresponding path program 1 times [2021-11-03 04:45:10,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:45:10,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294847601] [2021-11-03 04:45:10,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:45:10,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:45:10,354 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 04:45:10,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1151845804] [2021-11-03 04:45:10,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:45:10,355 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:45:10,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:45:10,356 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-03 04:45:10,356 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-03 04:45:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:45:13,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 3697 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-03 04:45:13,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:45:13,890 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-03 04:45:13,891 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-03 04:45:13,951 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-03 04:45:13,951 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-03 04:45:15,475 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-03 04:45:15,476 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-03 04:45:15,824 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-03 04:45:15,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:45:30,839 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-03 04:45:32,937 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-03 04:45:35,326 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-03 04:45:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 20 not checked. [2021-11-03 04:45:41,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:45:41,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294847601] [2021-11-03 04:45:41,466 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 04:45:41,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151845804] [2021-11-03 04:45:41,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151845804] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:45:41,466 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-03 04:45:41,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-11-03 04:45:41,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633314158] [2021-11-03 04:45:41,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-03 04:45:41,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:45:41,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-03 04:45:41,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=9, NotChecked=72, Total=240 [2021-11-03 04:45:41,468 INFO L87 Difference]: Start difference. First operand 2844 states and 3361 transitions. Second operand has 16 states, 16 states have (on average 35.875) internal successors, (574), 15 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:45:44,642 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-03 04:45:46,825 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-03 04:45:48,848 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-03 04:45:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:45:53,169 INFO L93 Difference]: Finished difference Result 4163 states and 4915 transitions. [2021-11-03 04:45:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 04:45:53,170 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 35.875) internal successors, (574), 15 states have internal predecessors, (574), 0 states have call successors, (0), 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 369 [2021-11-03 04:45:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:45:53,173 INFO L225 Difference]: With dead ends: 4163 [2021-11-03 04:45:53,173 INFO L226 Difference]: Without dead ends: 2975 [2021-11-03 04:45:53,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 721 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 24745.12ms TimeCoverageRelationStatistics Valid=60, Invalid=162, Unknown=12, NotChecked=186, Total=420 [2021-11-03 04:45:53,175 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 7343 mSDsCounter, 0 mSdLazyCounter, 3565 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3554.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.77ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5549 IncrementalHoareTripleChecker+Unchecked, 4794.78ms IncrementalHoareTripleChecker+Time [2021-11-03 04:45:53,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 9114 Unknown, 0 Unchecked, 12.77ms Time], IncrementalHoareTripleChecker [0 Valid, 3565 Invalid, 0 Unknown, 5549 Unchecked, 4794.78ms Time] [2021-11-03 04:45:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2021-11-03 04:45:53,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2905. [2021-11-03 04:45:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2905 states, 2904 states have (on average 1.1818181818181819) internal successors, (3432), 2904 states have internal predecessors, (3432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:45:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 3432 transitions. [2021-11-03 04:45:53,708 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 3432 transitions. Word has length 369 [2021-11-03 04:45:53,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:45:53,708 INFO L470 AbstractCegarLoop]: Abstraction has 2905 states and 3432 transitions. [2021-11-03 04:45:53,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 35.875) internal successors, (574), 15 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:45:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 3432 transitions. [2021-11-03 04:45:53,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2021-11-03 04:45:53,712 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:45:53,712 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:45:53,747 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-03 04:45:53,913 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-03 04:45:53,914 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-03 04:45:53,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:45:53,914 INFO L85 PathProgramCache]: Analyzing trace with hash 124756182, now seen corresponding path program 1 times [2021-11-03 04:45:53,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:45:53,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960123675] [2021-11-03 04:45:53,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:45:53,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:45:53,967 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 04:45:53,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1588365521] [2021-11-03 04:45:53,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:45:53,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:45:53,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:45:53,969 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-03 04:45:53,971 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-03 04:45:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:45:55,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 3694 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-03 04:45:55,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:45:56,889 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-03 04:45:56,889 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-03 04:45:56,961 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-03 04:45:56,961 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-03 04:45:58,628 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-03 04:45:58,628 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-03 04:45:58,973 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-03 04:45:58,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:46:13,971 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-03 04:46:16,037 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-03 04:46:18,317 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-03 04:46:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 20 not checked. [2021-11-03 04:46:24,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:46:24,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960123675] [2021-11-03 04:46:24,640 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 04:46:24,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588365521] [2021-11-03 04:46:24,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588365521] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:46:24,640 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-03 04:46:24,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-11-03 04:46:24,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656624088] [2021-11-03 04:46:24,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-03 04:46:24,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:46:24,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-03 04:46:24,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=9, NotChecked=72, Total=240 [2021-11-03 04:46:24,642 INFO L87 Difference]: Start difference. First operand 2905 states and 3432 transitions. Second operand has 16 states, 16 states have (on average 35.875) internal successors, (574), 15 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:46:28,067 WARN L838 $PredicateComparison]: unable to prove that (and (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)))))) (= 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-03 04:46:30,270 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_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)))))) (< (+ c_ULTIMATE.start_ldv_xmalloc_~res~4.base 1) |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-03 04:46:32,294 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.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-03 04:46:36,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:46:36,485 INFO L93 Difference]: Finished difference Result 4175 states and 4929 transitions. [2021-11-03 04:46:36,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 04:46:36,486 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 35.875) internal successors, (574), 15 states have internal predecessors, (574), 0 states have call successors, (0), 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 369 [2021-11-03 04:46:36,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:46:36,489 INFO L225 Difference]: With dead ends: 4175 [2021-11-03 04:46:36,489 INFO L226 Difference]: Without dead ends: 2987 [2021-11-03 04:46:36,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 721 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 24864.34ms TimeCoverageRelationStatistics Valid=60, Invalid=162, Unknown=12, NotChecked=186, Total=420 [2021-11-03 04:46:36,491 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 6584 mSDsCounter, 0 mSdLazyCounter, 3570 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3674.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.15ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4719 IncrementalHoareTripleChecker+Unchecked, 4910.75ms IncrementalHoareTripleChecker+Time [2021-11-03 04:46:36,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 8289 Unknown, 0 Unchecked, 11.15ms Time], IncrementalHoareTripleChecker [0 Valid, 3570 Invalid, 0 Unknown, 4719 Unchecked, 4910.75ms Time] [2021-11-03 04:46:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2021-11-03 04:46:37,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2905. [2021-11-03 04:46:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2905 states, 2904 states have (on average 1.1818181818181819) internal successors, (3432), 2904 states have internal predecessors, (3432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:46:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 3432 transitions. [2021-11-03 04:46:37,016 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 3432 transitions. Word has length 369 [2021-11-03 04:46:37,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:46:37,016 INFO L470 AbstractCegarLoop]: Abstraction has 2905 states and 3432 transitions. [2021-11-03 04:46:37,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 35.875) internal successors, (574), 15 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:46:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 3432 transitions. [2021-11-03 04:46:37,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2021-11-03 04:46:37,021 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:46:37,021 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:46:37,054 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-03 04:46:37,221 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-03 04:46:37,222 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-03 04:46:37,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:46:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash 796269033, now seen corresponding path program 1 times [2021-11-03 04:46:37,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:46:37,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984381987] [2021-11-03 04:46:37,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:46:37,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:46:37,269 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 04:46:37,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [296455938] [2021-11-03 04:46:37,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:46:37,269 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:46:37,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:46:37,271 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:46:37,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-03 04:46:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:46:38,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 3703 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-03 04:46:38,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:46:40,047 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-03 04:46:40,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-03 04:46:40,120 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-03 04:46:40,120 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-03 04:46:41,735 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-03 04:46:41,736 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-03 04:46:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-03 04:46:42,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:46:57,122 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_13 Int) (v_ULTIMATE.start_seq_next_~pos.base_13 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_13 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_13))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_13 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_13) 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_13) (= (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-03 04:46:59,176 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_13 Int) (v_ULTIMATE.start_seq_next_~pos.base_13 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_13 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_13))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_13 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_13) 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_13) (<= (mod .cse3 4294967296) 15)))))) is different from false [2021-11-03 04:47:01,423 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_13 Int) (v_ULTIMATE.start_seq_next_~pos.base_13 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_13 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_13))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_13 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_13) 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_13) (= (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-03 04:47:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 20 not checked. [2021-11-03 04:47:07,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:47:07,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984381987] [2021-11-03 04:47:07,188 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 04:47:07,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296455938] [2021-11-03 04:47:07,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296455938] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:47:07,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-03 04:47:07,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-11-03 04:47:07,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496561106] [2021-11-03 04:47:07,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-03 04:47:07,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:47:07,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-03 04:47:07,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=9, NotChecked=72, Total=240 [2021-11-03 04:47:07,198 INFO L87 Difference]: Start difference. First operand 2905 states and 3432 transitions. Second operand has 16 states, 16 states have (on average 36.0) internal successors, (576), 15 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:47:11,260 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_13 Int) (v_ULTIMATE.start_seq_next_~pos.base_13 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_13 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_13))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_13 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_13) 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_13) (= (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-03 04:47:13,671 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_seq_next_~pos.offset_13 Int) (v_ULTIMATE.start_seq_next_~pos.base_13 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_13 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_13))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_13 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_13) 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_13) (<= (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~4.base 1) |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-03 04:47:15,742 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_13 Int) (v_ULTIMATE.start_seq_next_~pos.base_13 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_13 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_13))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_13 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_13) 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_13) (= (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-03 04:47:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:47:28,151 INFO L93 Difference]: Finished difference Result 4492 states and 5323 transitions. [2021-11-03 04:47:28,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 04:47:28,151 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 36.0) internal successors, (576), 15 states have internal predecessors, (576), 0 states have call successors, (0), 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 370 [2021-11-03 04:47:28,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:47:28,155 INFO L225 Difference]: With dead ends: 4492 [2021-11-03 04:47:28,155 INFO L226 Difference]: Without dead ends: 3304 [2021-11-03 04:47:28,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 724 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 24817.68ms TimeCoverageRelationStatistics Valid=60, Invalid=162, Unknown=12, NotChecked=186, Total=420 [2021-11-03 04:47:28,157 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 218 mSDsluCounter, 10661 mSDsCounter, 0 mSdLazyCounter, 8029 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10847.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 13030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 31.08ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5000 IncrementalHoareTripleChecker+Unchecked, 13871.27ms IncrementalHoareTripleChecker+Time [2021-11-03 04:47:28,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 0 Invalid, 13030 Unknown, 0 Unchecked, 31.08ms Time], IncrementalHoareTripleChecker [1 Valid, 8029 Invalid, 0 Unknown, 5000 Unchecked, 13871.27ms Time] [2021-11-03 04:47:28,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3304 states. [2021-11-03 04:47:28,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3304 to 2908. [2021-11-03 04:47:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2908 states, 2907 states have (on average 1.1819745442036464) internal successors, (3436), 2907 states have internal predecessors, (3436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:47:28,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 3436 transitions. [2021-11-03 04:47:28,684 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 3436 transitions. Word has length 370 [2021-11-03 04:47:28,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:47:28,684 INFO L470 AbstractCegarLoop]: Abstraction has 2908 states and 3436 transitions. [2021-11-03 04:47:28,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 36.0) internal successors, (576), 15 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:47:28,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 3436 transitions. [2021-11-03 04:47:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2021-11-03 04:47:28,688 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:47:28,688 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:47:28,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-11-03 04:47:28,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:47:28,889 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-03 04:47:28,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:47:28,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1305047847, now seen corresponding path program 1 times [2021-11-03 04:47:28,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:47:28,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73241570] [2021-11-03 04:47:28,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:47:28,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:47:28,952 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 04:47:28,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2094460112] [2021-11-03 04:47:28,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:47:28,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:47:28,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:47:28,954 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:47:28,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-03 04:47:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:47:32,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 3700 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-03 04:47:32,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:47:34,032 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-03 04:47:34,032 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-03 04:47:34,105 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-03 04:47:34,106 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-03 04:47:35,970 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-03 04:47:35,970 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-03 04:47:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-03 04:47:36,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:47:51,306 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_14 Int) (v_ULTIMATE.start_seq_next_~pos.base_14 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_14 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_14))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_14 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_14) 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) (<= (mod .cse3 4294967296) 15) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_14)))))) is different from false [2021-11-03 04:47:53,372 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_14 Int) (v_ULTIMATE.start_seq_next_~pos.base_14 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_14 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_14))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_14 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_14) 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_14) (<= (mod .cse3 4294967296) 15)))))) is different from false [2021-11-03 04:47:55,641 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_14 Int) (v_ULTIMATE.start_seq_next_~pos.base_14 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_14 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_14))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_14 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_14) 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) (<= (mod .cse3 4294967296) 15) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_14)))))) is different from false [2021-11-03 04:47:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 20 not checked. [2021-11-03 04:47:59,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:47:59,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73241570] [2021-11-03 04:47:59,853 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 04:47:59,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094460112] [2021-11-03 04:47:59,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094460112] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:47:59,854 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-03 04:47:59,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-11-03 04:47:59,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754341186] [2021-11-03 04:47:59,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-03 04:47:59,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:47:59,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-03 04:47:59,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=9, NotChecked=72, Total=240 [2021-11-03 04:47:59,855 INFO L87 Difference]: Start difference. First operand 2908 states and 3436 transitions. Second operand has 16 states, 16 states have (on average 36.0) internal successors, (576), 15 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:48:03,645 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_14 Int) (v_ULTIMATE.start_seq_next_~pos.base_14 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_14 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_14))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_14 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_14) 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) (<= (mod .cse3 4294967296) 15) (<= |c_#StackHeapBarrier| v_ULTIMATE.start_seq_next_~pos.base_14)))))) (< |c_#StackHeapBarrier| |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-03 04:48:06,095 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_14 Int) (v_ULTIMATE.start_seq_next_~pos.base_14 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_14 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_14))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_14 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_14) 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_14) (<= (mod .cse3 4294967296) 15)))))) (< (+ c_ULTIMATE.start_ldv_xmalloc_~res~4.base 1) |c_~#nfnl_log_net_id~0.base|)) is different from false [2021-11-03 04:48:08,165 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.offset_14 Int) (v_ULTIMATE.start_seq_next_~pos.base_14 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_14 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_14))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_14 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_14) 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) (<= (mod .cse3 4294967296) 15) (< |c_ULTIMATE.start_ldv_xmalloc_#res.base| v_ULTIMATE.start_seq_next_~pos.base_14))))))) is different from false [2021-11-03 04:48:19,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:48:19,372 INFO L93 Difference]: Finished difference Result 4291 states and 5061 transitions. [2021-11-03 04:48:19,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 04:48:19,373 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 36.0) internal successors, (576), 15 states have internal predecessors, (576), 0 states have call successors, (0), 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 370 [2021-11-03 04:48:19,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:48:19,376 INFO L225 Difference]: With dead ends: 4291 [2021-11-03 04:48:19,376 INFO L226 Difference]: Without dead ends: 3103 [2021-11-03 04:48:19,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 724 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 24897.22ms TimeCoverageRelationStatistics Valid=60, Invalid=162, Unknown=12, NotChecked=186, Total=420 [2021-11-03 04:48:19,379 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 8722 mSDsCounter, 0 mSdLazyCounter, 6056 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9608.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 27.56ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4549 IncrementalHoareTripleChecker+Unchecked, 12504.68ms IncrementalHoareTripleChecker+Time [2021-11-03 04:48:19,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 10606 Unknown, 0 Unchecked, 27.56ms Time], IncrementalHoareTripleChecker [1 Valid, 6056 Invalid, 0 Unknown, 4549 Unchecked, 12504.68ms Time] [2021-11-03 04:48:19,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3103 states. [2021-11-03 04:48:19,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3103 to 3024. [2021-11-03 04:48:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3024 states, 3023 states have (on average 1.1796228911677142) internal successors, (3566), 3023 states have internal predecessors, (3566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:48:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 3024 states and 3566 transitions. [2021-11-03 04:48:19,912 INFO L78 Accepts]: Start accepts. Automaton has 3024 states and 3566 transitions. Word has length 370 [2021-11-03 04:48:19,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:48:19,912 INFO L470 AbstractCegarLoop]: Abstraction has 3024 states and 3566 transitions. [2021-11-03 04:48:19,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 36.0) internal successors, (576), 15 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:48:19,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3024 states and 3566 transitions. [2021-11-03 04:48:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2021-11-03 04:48:19,916 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:48:19,916 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:48:19,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2021-11-03 04:48:20,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2021-11-03 04:48:20,117 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-03 04:48:20,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:48:20,118 INFO L85 PathProgramCache]: Analyzing trace with hash 454837495, now seen corresponding path program 1 times [2021-11-03 04:48:20,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:48:20,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630720591] [2021-11-03 04:48:20,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:48:20,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:48:20,165 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 04:48:20,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1026923198] [2021-11-03 04:48:20,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:48:20,165 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:48:20,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:48:20,167 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:48:20,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-03 04:48:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:48:22,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 3700 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-03 04:48:22,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:48:23,769 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-03 04:48:23,769 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-03 04:48:23,847 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-03 04:48:23,847 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-03 04:48:25,903 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-03 04:48:25,903 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-03 04:48:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-03 04:48:26,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:48:41,325 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_15 Int) (v_ULTIMATE.start_seq_next_~pos.base_15 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_15 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_15))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_15 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_15) 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_15)))))) is different from false [2021-11-03 04:48:43,448 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_seq_next_~pos.offset_15 Int) (v_ULTIMATE.start_seq_next_~pos.base_15 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_15 (let ((.cse4 (select |c_#memory_int| v_ULTIMATE.start_seq_next_~pos.base_15))) (store .cse4 v_ULTIMATE.start_seq_next_~pos.offset_15 (+ (select .cse4 v_ULTIMATE.start_seq_next_~pos.offset_15) 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_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 Killed by 15