./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 173e3943 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---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-dev-173e394 [2021-11-06 22:12:34,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 22:12:34,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 22:12:34,144 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 22:12:34,145 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 22:12:34,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 22:12:34,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 22:12:34,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 22:12:34,149 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 22:12:34,149 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 22:12:34,150 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 22:12:34,151 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 22:12:34,151 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 22:12:34,152 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 22:12:34,153 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 22:12:34,154 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 22:12:34,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 22:12:34,155 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 22:12:34,156 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 22:12:34,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 22:12:34,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 22:12:34,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 22:12:34,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 22:12:34,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 22:12:34,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 22:12:34,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 22:12:34,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 22:12:34,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 22:12:34,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 22:12:34,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 22:12:34,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 22:12:34,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 22:12:34,167 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 22:12:34,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 22:12:34,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 22:12:34,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 22:12:34,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 22:12:34,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 22:12:34,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 22:12:34,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 22:12:34,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 22:12:34,171 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 22:12:34,186 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 22:12:34,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 22:12:34,186 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 22:12:34,186 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 22:12:34,187 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 22:12:34,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 22:12:34,188 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 22:12:34,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 22:12:34,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 22:12:34,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 22:12:34,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 22:12:34,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 22:12:34,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 22:12:34,189 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 22:12:34,189 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 22:12:34,189 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 22:12:34,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 22:12:34,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 22:12:34,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 22:12:34,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 22:12:34,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 22:12:34,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 22:12:34,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 22:12:34,190 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 22:12:34,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 22:12:34,191 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 22:12:34,191 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 22:12:34,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 22:12:34,191 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 22:12:34,192 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-06 22:12:34,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 22:12:34,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 22:12:34,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 22:12:34,374 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 22:12:34,374 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 22:12:34,375 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2021-11-06 22:12:34,433 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a6955ba/3a7474a6e1544071bf5cf14ccaa448fc/FLAG1b91bdc25 [2021-11-06 22:12:35,014 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 22:12:35,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2021-11-06 22:12:35,057 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a6955ba/3a7474a6e1544071bf5cf14ccaa448fc/FLAG1b91bdc25 [2021-11-06 22:12:35,184 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a6955ba/3a7474a6e1544071bf5cf14ccaa448fc [2021-11-06 22:12:35,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 22:12:35,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 22:12:35,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 22:12:35,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 22:12:35,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 22:12:35,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:12:35" (1/1) ... [2021-11-06 22:12:35,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d624825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:35, skipping insertion in model container [2021-11-06 22:12:35,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:12:35" (1/1) ... [2021-11-06 22:12:35,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 22:12:35,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 22:12:37,799 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400642,400655] [2021-11-06 22:12:37,801 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400787,400800] [2021-11-06 22:12:37,802 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400933,400946] [2021-11-06 22:12:37,802 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401098,401111] [2021-11-06 22:12:37,803 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401256,401269] [2021-11-06 22:12:37,803 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401414,401427] [2021-11-06 22:12:37,803 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401572,401585] [2021-11-06 22:12:37,804 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401732,401745] [2021-11-06 22:12:37,804 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401891,401904] [2021-11-06 22:12:37,804 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402030,402043] [2021-11-06 22:12:37,805 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402172,402185] [2021-11-06 22:12:37,805 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402321,402334] [2021-11-06 22:12:37,805 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402460,402473] [2021-11-06 22:12:37,805 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402615,402628] [2021-11-06 22:12:37,806 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402775,402788] [2021-11-06 22:12:37,806 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402926,402939] [2021-11-06 22:12:37,806 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403077,403090] [2021-11-06 22:12:37,807 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403229,403242] [2021-11-06 22:12:37,807 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403378,403391] [2021-11-06 22:12:37,807 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403526,403539] [2021-11-06 22:12:37,808 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403683,403696] [2021-11-06 22:12:37,808 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403832,403845] [2021-11-06 22:12:37,808 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403988,404001] [2021-11-06 22:12:37,809 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404141,404154] [2021-11-06 22:12:37,809 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404287,404300] [2021-11-06 22:12:37,809 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404430,404443] [2021-11-06 22:12:37,809 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404582,404595] [2021-11-06 22:12:37,810 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404728,404741] [2021-11-06 22:12:37,810 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404873,404886] [2021-11-06 22:12:37,810 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405027,405040] [2021-11-06 22:12:37,811 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405178,405191] [2021-11-06 22:12:37,811 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405333,405346] [2021-11-06 22:12:37,812 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405485,405498] [2021-11-06 22:12:37,812 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405640,405653] [2021-11-06 22:12:37,812 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405804,405817] [2021-11-06 22:12:37,812 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405960,405973] [2021-11-06 22:12:37,813 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406124,406137] [2021-11-06 22:12:37,813 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406266,406279] [2021-11-06 22:12:37,813 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406424,406437] [2021-11-06 22:12:37,814 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406591,406604] [2021-11-06 22:12:37,814 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406750,406763] [2021-11-06 22:12:37,814 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406909,406922] [2021-11-06 22:12:37,815 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407058,407071] [2021-11-06 22:12:37,815 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407205,407218] [2021-11-06 22:12:37,815 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407344,407357] [2021-11-06 22:12:37,815 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407507,407520] [2021-11-06 22:12:37,816 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407673,407686] [2021-11-06 22:12:37,816 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407837,407850] [2021-11-06 22:12:37,816 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408002,408015] [2021-11-06 22:12:37,817 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408167,408180] [2021-11-06 22:12:37,817 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408333,408346] [2021-11-06 22:12:37,817 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408498,408511] [2021-11-06 22:12:37,818 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408665,408678] [2021-11-06 22:12:37,818 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408825,408838] [2021-11-06 22:12:37,818 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408987,409000] [2021-11-06 22:12:37,818 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409146,409159] [2021-11-06 22:12:37,819 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409292,409305] [2021-11-06 22:12:37,819 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409435,409448] [2021-11-06 22:12:37,819 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409579,409592] [2021-11-06 22:12:37,820 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409722,409735] [2021-11-06 22:12:37,820 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409866,409879] [2021-11-06 22:12:37,820 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410007,410020] [2021-11-06 22:12:37,821 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410145,410158] [2021-11-06 22:12:37,821 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410303,410316] [2021-11-06 22:12:37,821 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410462,410475] [2021-11-06 22:12:37,821 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410618,410631] [2021-11-06 22:12:37,822 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410767,410780] [2021-11-06 22:12:37,822 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410919,410932] [2021-11-06 22:12:37,822 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411070,411083] [2021-11-06 22:12:37,823 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411219,411232] [2021-11-06 22:12:37,823 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411371,411384] [2021-11-06 22:12:37,823 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411519,411532] [2021-11-06 22:12:37,824 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411672,411685] [2021-11-06 22:12:37,824 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411823,411836] [2021-11-06 22:12:37,824 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411973,411986] [2021-11-06 22:12:37,824 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412120,412133] [2021-11-06 22:12:37,825 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412271,412284] [2021-11-06 22:12:37,825 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412422,412435] [2021-11-06 22:12:37,825 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412570,412583] [2021-11-06 22:12:37,826 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412736,412749] [2021-11-06 22:12:37,826 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412905,412918] [2021-11-06 22:12:37,826 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413072,413085] [2021-11-06 22:12:37,827 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413240,413253] [2021-11-06 22:12:37,827 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413390,413403] [2021-11-06 22:12:37,827 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413537,413550] [2021-11-06 22:12:37,827 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413698,413711] [2021-11-06 22:12:37,828 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413868,413881] [2021-11-06 22:12:37,828 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[414030,414043] [2021-11-06 22:12:37,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 22:12:37,857 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 22:12:38,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[400642,400655] [2021-11-06 22:12:38,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[400787,400800] [2021-11-06 22:12:38,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[400933,400946] [2021-11-06 22:12:38,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[401098,401111] [2021-11-06 22:12:38,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[401256,401269] [2021-11-06 22:12:38,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[401414,401427] [2021-11-06 22:12:38,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[401572,401585] [2021-11-06 22:12:38,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[401732,401745] [2021-11-06 22:12:38,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[401891,401904] [2021-11-06 22:12:38,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[402030,402043] [2021-11-06 22:12:38,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[402172,402185] [2021-11-06 22:12:38,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[402321,402334] [2021-11-06 22:12:38,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[402460,402473] [2021-11-06 22:12:38,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[402615,402628] [2021-11-06 22:12:38,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[402775,402788] [2021-11-06 22:12:38,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[402926,402939] [2021-11-06 22:12:38,105 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403077,403090] [2021-11-06 22:12:38,105 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403229,403242] [2021-11-06 22:12:38,106 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403378,403391] [2021-11-06 22:12:38,106 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403526,403539] [2021-11-06 22:12:38,106 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403683,403696] [2021-11-06 22:12:38,106 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403832,403845] [2021-11-06 22:12:38,107 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403988,404001] [2021-11-06 22:12:38,107 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404141,404154] [2021-11-06 22:12:38,108 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404287,404300] [2021-11-06 22:12:38,108 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404430,404443] [2021-11-06 22:12:38,108 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404582,404595] [2021-11-06 22:12:38,109 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404728,404741] [2021-11-06 22:12:38,109 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404873,404886] [2021-11-06 22:12:38,109 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405027,405040] [2021-11-06 22:12:38,110 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405178,405191] [2021-11-06 22:12:38,110 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405333,405346] [2021-11-06 22:12:38,110 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405485,405498] [2021-11-06 22:12:38,110 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405640,405653] [2021-11-06 22:12:38,111 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405804,405817] [2021-11-06 22:12:38,111 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405960,405973] [2021-11-06 22:12:38,112 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406124,406137] [2021-11-06 22:12:38,112 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406266,406279] [2021-11-06 22:12:38,112 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406424,406437] [2021-11-06 22:12:38,112 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406591,406604] [2021-11-06 22:12:38,113 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406750,406763] [2021-11-06 22:12:38,114 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406909,406922] [2021-11-06 22:12:38,115 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407058,407071] [2021-11-06 22:12:38,115 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407205,407218] [2021-11-06 22:12:38,116 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407344,407357] [2021-11-06 22:12:38,116 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407507,407520] [2021-11-06 22:12:38,116 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407673,407686] [2021-11-06 22:12:38,116 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407837,407850] [2021-11-06 22:12:38,117 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408002,408015] [2021-11-06 22:12:38,117 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408167,408180] [2021-11-06 22:12:38,117 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408333,408346] [2021-11-06 22:12:38,118 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408498,408511] [2021-11-06 22:12:38,118 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408665,408678] [2021-11-06 22:12:38,119 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408825,408838] [2021-11-06 22:12:38,119 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408987,409000] [2021-11-06 22:12:38,119 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409146,409159] [2021-11-06 22:12:38,120 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409292,409305] [2021-11-06 22:12:38,120 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409435,409448] [2021-11-06 22:12:38,121 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409579,409592] [2021-11-06 22:12:38,121 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409722,409735] [2021-11-06 22:12:38,121 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409866,409879] [2021-11-06 22:12:38,121 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410007,410020] [2021-11-06 22:12:38,122 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410145,410158] [2021-11-06 22:12:38,122 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410303,410316] [2021-11-06 22:12:38,123 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410462,410475] [2021-11-06 22:12:38,125 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410618,410631] [2021-11-06 22:12:38,125 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410767,410780] [2021-11-06 22:12:38,128 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410919,410932] [2021-11-06 22:12:38,129 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411070,411083] [2021-11-06 22:12:38,130 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411219,411232] [2021-11-06 22:12:38,130 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411371,411384] [2021-11-06 22:12:38,130 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411519,411532] [2021-11-06 22:12:38,130 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411672,411685] [2021-11-06 22:12:38,131 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411823,411836] [2021-11-06 22:12:38,134 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411973,411986] [2021-11-06 22:12:38,135 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412120,412133] [2021-11-06 22:12:38,137 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412271,412284] [2021-11-06 22:12:38,138 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412422,412435] [2021-11-06 22:12:38,139 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412570,412583] [2021-11-06 22:12:38,139 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412736,412749] [2021-11-06 22:12:38,139 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412905,412918] [2021-11-06 22:12:38,140 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413072,413085] [2021-11-06 22:12:38,140 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413240,413253] [2021-11-06 22:12:38,141 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413390,413403] [2021-11-06 22:12:38,141 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413537,413550] [2021-11-06 22:12:38,141 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413698,413711] [2021-11-06 22:12:38,141 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413868,413881] [2021-11-06 22:12:38,142 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[414030,414043] [2021-11-06 22:12:38,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 22:12:38,292 INFO L208 MainTranslator]: Completed translation [2021-11-06 22:12:38,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:38 WrapperNode [2021-11-06 22:12:38,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 22:12:38,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 22:12:38,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 22:12:38,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 22:12:38,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:38" (1/1) ... [2021-11-06 22:12:38,374 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:38" (1/1) ... [2021-11-06 22:12:38,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 22:12:38,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 22:12:38,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 22:12:38,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 22:12:38,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:38" (1/1) ... [2021-11-06 22:12:38,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:38" (1/1) ... [2021-11-06 22:12:38,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:38" (1/1) ... [2021-11-06 22:12:38,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:38" (1/1) ... [2021-11-06 22:12:38,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:38" (1/1) ... [2021-11-06 22:12:38,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:38" (1/1) ... [2021-11-06 22:12:38,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:38" (1/1) ... [2021-11-06 22:12:38,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 22:12:38,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 22:12:38,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 22:12:38,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 22:12:38,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:38" (1/1) ... [2021-11-06 22:12:38,664 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 22:12:38,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:12:38,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 22:12:38,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 22:12:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 22:12:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 22:12:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 22:12:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 22:12:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 22:12:38,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 22:12:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure __cmpxchg_wrong_size [2021-11-06 22:12:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 22:12:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 22:12:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 22:12:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 22:12:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 22:12:40,884 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L9761: #t~ret860 := main_#res; [2021-11-06 22:12:40,885 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-06 22:12:40,885 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_11_returnLabel: main_#res := 0; [2021-11-06 22:12:40,896 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 22:12:40,896 INFO L299 CfgBuilder]: Removed 1678 assume(true) statements. [2021-11-06 22:12:40,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:12:40 BoogieIcfgContainer [2021-11-06 22:12:40,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 22:12:40,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 22:12:40,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 22:12:40,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 22:12:40,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:12:35" (1/3) ... [2021-11-06 22:12:40,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad11c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:12:40, skipping insertion in model container [2021-11-06 22:12:40,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:38" (2/3) ... [2021-11-06 22:12:40,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad11c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:12:40, skipping insertion in model container [2021-11-06 22:12:40,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:12:40" (3/3) ... [2021-11-06 22:12:40,905 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2021-11-06 22:12:40,908 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 22:12:40,908 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 112 error locations. [2021-11-06 22:12:40,939 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 22:12:40,942 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 22:12:40,942 INFO L340 AbstractCegarLoop]: Starting to check reachability of 112 error locations. [2021-11-06 22:12:40,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 1427 states, 1315 states have (on average 1.388593155893536) internal successors, (1826), 1426 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:40,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-06 22:12:40,971 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:40,972 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:40,972 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:12:40,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:40,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1114166620, now seen corresponding path program 1 times [2021-11-06 22:12:40,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:40,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014391240] [2021-11-06 22:12:40,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:40,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:41,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:41,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:41,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014391240] [2021-11-06 22:12:41,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014391240] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:41,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:41,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:41,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082625740] [2021-11-06 22:12:41,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:41,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:41,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:41,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:41,384 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-06 22:12:41,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:41,469 INFO L93 Difference]: Finished difference Result 2822 states and 3612 transitions. [2021-11-06 22:12:41,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:41,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-06 22:12:41,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:41,482 INFO L225 Difference]: With dead ends: 2822 [2021-11-06 22:12:41,482 INFO L226 Difference]: Without dead ends: 1328 [2021-11-06 22:12:41,486 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2021-11-06 22:12:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1328. [2021-11-06 22:12:41,543 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-06 22:12:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1500 transitions. [2021-11-06 22:12:41,546 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1500 transitions. Word has length 32 [2021-11-06 22:12:41,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:41,546 INFO L470 AbstractCegarLoop]: Abstraction has 1328 states and 1500 transitions. [2021-11-06 22:12:41,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1500 transitions. [2021-11-06 22:12:41,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-06 22:12:41,547 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:41,548 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:41,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 22:12:41,548 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-06 22:12:41,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:41,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1267414080, now seen corresponding path program 1 times [2021-11-06 22:12:41,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:41,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493494562] [2021-11-06 22:12:41,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:41,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:41,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:41,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493494562] [2021-11-06 22:12:41,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493494562] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:41,638 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:41,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:41,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869195302] [2021-11-06 22:12:41,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:41,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:41,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:41,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:41,640 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-06 22:12:41,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:41,677 INFO L93 Difference]: Finished difference Result 1328 states and 1500 transitions. [2021-11-06 22:12:41,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:41,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-06 22:12:41,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:41,680 INFO L225 Difference]: With dead ends: 1328 [2021-11-06 22:12:41,680 INFO L226 Difference]: Without dead ends: 1324 [2021-11-06 22:12:41,681 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:41,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2021-11-06 22:12:41,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1324. [2021-11-06 22:12:41,710 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-06 22:12:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1496 transitions. [2021-11-06 22:12:41,712 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1496 transitions. Word has length 34 [2021-11-06 22:12:41,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:41,713 INFO L470 AbstractCegarLoop]: Abstraction has 1324 states and 1496 transitions. [2021-11-06 22:12:41,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1496 transitions. [2021-11-06 22:12:41,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 22:12:41,717 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:41,717 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:41,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 22:12:41,717 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-06 22:12:41,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:41,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1801578912, now seen corresponding path program 1 times [2021-11-06 22:12:41,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:41,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937600833] [2021-11-06 22:12:41,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:41,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:41,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:41,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937600833] [2021-11-06 22:12:41,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937600833] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:41,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:41,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:12:41,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558036985] [2021-11-06 22:12:41,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 22:12:41,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:41,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 22:12:41,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:41,908 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-06 22:12:42,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:42,171 INFO L93 Difference]: Finished difference Result 1938 states and 2168 transitions. [2021-11-06 22:12:42,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 22:12:42,171 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-06 22:12:42,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:42,177 INFO L225 Difference]: With dead ends: 1938 [2021-11-06 22:12:42,178 INFO L226 Difference]: Without dead ends: 1926 [2021-11-06 22:12:42,179 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 22:12:42,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2021-11-06 22:12:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1644. [2021-11-06 22:12:42,224 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-06 22:12:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 1861 transitions. [2021-11-06 22:12:42,228 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 1861 transitions. Word has length 36 [2021-11-06 22:12:42,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:42,228 INFO L470 AbstractCegarLoop]: Abstraction has 1644 states and 1861 transitions. [2021-11-06 22:12:42,228 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-06 22:12:42,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 1861 transitions. [2021-11-06 22:12:42,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 22:12:42,229 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:42,229 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:42,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 22:12:42,230 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-06 22:12:42,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:42,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1785631868, now seen corresponding path program 1 times [2021-11-06 22:12:42,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:42,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638753077] [2021-11-06 22:12:42,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:42,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:42,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:42,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638753077] [2021-11-06 22:12:42,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638753077] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:42,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:42,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:42,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756232203] [2021-11-06 22:12:42,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:42,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:42,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:42,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:42,310 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-06 22:12:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:42,379 INFO L93 Difference]: Finished difference Result 1644 states and 1861 transitions. [2021-11-06 22:12:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:42,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-06 22:12:42,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:42,386 INFO L225 Difference]: With dead ends: 1644 [2021-11-06 22:12:42,387 INFO L226 Difference]: Without dead ends: 1640 [2021-11-06 22:12:42,388 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:42,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2021-11-06 22:12:42,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2021-11-06 22:12:42,455 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-06 22:12:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 1857 transitions. [2021-11-06 22:12:42,458 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 1857 transitions. Word has length 36 [2021-11-06 22:12:42,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:42,460 INFO L470 AbstractCegarLoop]: Abstraction has 1640 states and 1857 transitions. [2021-11-06 22:12:42,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:42,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1857 transitions. [2021-11-06 22:12:42,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-06 22:12:42,461 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:42,462 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:42,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 22:12:42,462 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-06 22:12:42,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:42,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1994842920, now seen corresponding path program 1 times [2021-11-06 22:12:42,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:42,464 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476403653] [2021-11-06 22:12:42,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:42,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:42,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:42,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476403653] [2021-11-06 22:12:42,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476403653] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:42,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:42,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:42,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664049573] [2021-11-06 22:12:42,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:42,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:42,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:42,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:42,578 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-06 22:12:42,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:42,643 INFO L93 Difference]: Finished difference Result 1640 states and 1857 transitions. [2021-11-06 22:12:42,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:42,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-06 22:12:42,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:42,647 INFO L225 Difference]: With dead ends: 1640 [2021-11-06 22:12:42,647 INFO L226 Difference]: Without dead ends: 1636 [2021-11-06 22:12:42,648 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:42,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2021-11-06 22:12:42,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1636. [2021-11-06 22:12:42,694 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-06 22:12:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 1853 transitions. [2021-11-06 22:12:42,697 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 1853 transitions. Word has length 38 [2021-11-06 22:12:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:42,698 INFO L470 AbstractCegarLoop]: Abstraction has 1636 states and 1853 transitions. [2021-11-06 22:12:42,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 1853 transitions. [2021-11-06 22:12:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-06 22:12:42,698 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:42,698 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:42,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 22:12:42,699 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-06 22:12:42,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:42,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1488782124, now seen corresponding path program 1 times [2021-11-06 22:12:42,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:42,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073659846] [2021-11-06 22:12:42,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:42,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:42,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:42,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073659846] [2021-11-06 22:12:42,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073659846] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:42,785 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:42,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:42,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054094751] [2021-11-06 22:12:42,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:42,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:42,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:42,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:42,787 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-06 22:12:42,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:42,835 INFO L93 Difference]: Finished difference Result 1636 states and 1853 transitions. [2021-11-06 22:12:42,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:42,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-06 22:12:42,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:42,841 INFO L225 Difference]: With dead ends: 1636 [2021-11-06 22:12:42,841 INFO L226 Difference]: Without dead ends: 1632 [2021-11-06 22:12:42,841 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:42,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2021-11-06 22:12:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1632. [2021-11-06 22:12:42,897 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-06 22:12:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 1849 transitions. [2021-11-06 22:12:42,900 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 1849 transitions. Word has length 40 [2021-11-06 22:12:42,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:42,900 INFO L470 AbstractCegarLoop]: Abstraction has 1632 states and 1849 transitions. [2021-11-06 22:12:42,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:42,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 1849 transitions. [2021-11-06 22:12:42,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 22:12:42,902 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:42,902 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:42,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 22:12:42,902 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-06 22:12:42,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:42,903 INFO L85 PathProgramCache]: Analyzing trace with hash 495661968, now seen corresponding path program 1 times [2021-11-06 22:12:42,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:42,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077255581] [2021-11-06 22:12:42,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:42,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:42,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:42,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:42,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077255581] [2021-11-06 22:12:42,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077255581] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:42,993 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:42,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:42,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692894240] [2021-11-06 22:12:42,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:42,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:42,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:42,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:42,996 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-06 22:12:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:43,052 INFO L93 Difference]: Finished difference Result 1632 states and 1849 transitions. [2021-11-06 22:12:43,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:43,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-06 22:12:43,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:43,057 INFO L225 Difference]: With dead ends: 1632 [2021-11-06 22:12:43,059 INFO L226 Difference]: Without dead ends: 1628 [2021-11-06 22:12:43,060 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2021-11-06 22:12:43,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1628. [2021-11-06 22:12:43,099 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-06 22:12:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 1845 transitions. [2021-11-06 22:12:43,102 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 1845 transitions. Word has length 42 [2021-11-06 22:12:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:43,102 INFO L470 AbstractCegarLoop]: Abstraction has 1628 states and 1845 transitions. [2021-11-06 22:12:43,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:43,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1845 transitions. [2021-11-06 22:12:43,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-06 22:12:43,103 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:43,103 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:43,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 22:12:43,104 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-06 22:12:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:43,104 INFO L85 PathProgramCache]: Analyzing trace with hash -410067884, now seen corresponding path program 1 times [2021-11-06 22:12:43,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:43,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987967954] [2021-11-06 22:12:43,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:43,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:43,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:43,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987967954] [2021-11-06 22:12:43,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987967954] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:43,164 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:43,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:43,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426101305] [2021-11-06 22:12:43,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:43,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:43,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:43,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:43,166 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-06 22:12:43,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:43,218 INFO L93 Difference]: Finished difference Result 1628 states and 1845 transitions. [2021-11-06 22:12:43,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:43,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-06 22:12:43,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:43,222 INFO L225 Difference]: With dead ends: 1628 [2021-11-06 22:12:43,222 INFO L226 Difference]: Without dead ends: 1624 [2021-11-06 22:12:43,222 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2021-11-06 22:12:43,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1624. [2021-11-06 22:12:43,264 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-06 22:12:43,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 1841 transitions. [2021-11-06 22:12:43,266 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 1841 transitions. Word has length 44 [2021-11-06 22:12:43,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:43,266 INFO L470 AbstractCegarLoop]: Abstraction has 1624 states and 1841 transitions. [2021-11-06 22:12:43,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1841 transitions. [2021-11-06 22:12:43,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-06 22:12:43,267 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:43,267 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:43,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 22:12:43,267 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-06 22:12:43,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:43,268 INFO L85 PathProgramCache]: Analyzing trace with hash -246411345, now seen corresponding path program 1 times [2021-11-06 22:12:43,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:43,268 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63159522] [2021-11-06 22:12:43,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:43,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:43,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:43,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63159522] [2021-11-06 22:12:43,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63159522] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:43,352 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:43,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:43,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946824184] [2021-11-06 22:12:43,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:43,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:43,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:43,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:43,353 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-06 22:12:43,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:43,478 INFO L93 Difference]: Finished difference Result 2351 states and 2661 transitions. [2021-11-06 22:12:43,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:12:43,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-06 22:12:43,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:43,483 INFO L225 Difference]: With dead ends: 2351 [2021-11-06 22:12:43,483 INFO L226 Difference]: Without dead ends: 2345 [2021-11-06 22:12:43,484 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:43,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2021-11-06 22:12:43,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 1618. [2021-11-06 22:12:43,553 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-06 22:12:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 1835 transitions. [2021-11-06 22:12:43,556 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 1835 transitions. Word has length 46 [2021-11-06 22:12:43,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:43,556 INFO L470 AbstractCegarLoop]: Abstraction has 1618 states and 1835 transitions. [2021-11-06 22:12:43,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 1835 transitions. [2021-11-06 22:12:43,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-06 22:12:43,557 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:43,557 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:43,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 22:12:43,557 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-06 22:12:43,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:43,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1061905784, now seen corresponding path program 1 times [2021-11-06 22:12:43,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:43,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696725200] [2021-11-06 22:12:43,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:43,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:43,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:43,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696725200] [2021-11-06 22:12:43,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696725200] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:43,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:43,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:43,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756675365] [2021-11-06 22:12:43,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:43,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:43,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:43,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:43,620 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-06 22:12:43,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:43,682 INFO L93 Difference]: Finished difference Result 1618 states and 1835 transitions. [2021-11-06 22:12:43,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:43,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-06 22:12:43,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:43,686 INFO L225 Difference]: With dead ends: 1618 [2021-11-06 22:12:43,686 INFO L226 Difference]: Without dead ends: 1614 [2021-11-06 22:12:43,687 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:43,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2021-11-06 22:12:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1614. [2021-11-06 22:12:43,738 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-06 22:12:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 1831 transitions. [2021-11-06 22:12:43,741 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 1831 transitions. Word has length 46 [2021-11-06 22:12:43,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:43,741 INFO L470 AbstractCegarLoop]: Abstraction has 1614 states and 1831 transitions. [2021-11-06 22:12:43,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 1831 transitions. [2021-11-06 22:12:43,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 22:12:43,742 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:43,742 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:43,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 22:12:43,743 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-06 22:12:43,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:43,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1710607589, now seen corresponding path program 1 times [2021-11-06 22:12:43,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:43,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148469766] [2021-11-06 22:12:43,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:43,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:43,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:43,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:43,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148469766] [2021-11-06 22:12:43,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148469766] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:43,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:43,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:43,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252648079] [2021-11-06 22:12:43,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:43,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:43,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:43,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:43,829 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-06 22:12:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:43,894 INFO L93 Difference]: Finished difference Result 1614 states and 1831 transitions. [2021-11-06 22:12:43,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:43,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-06 22:12:43,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:43,898 INFO L225 Difference]: With dead ends: 1614 [2021-11-06 22:12:43,898 INFO L226 Difference]: Without dead ends: 1610 [2021-11-06 22:12:43,898 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:43,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2021-11-06 22:12:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1610. [2021-11-06 22:12:43,951 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-06 22:12:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 1827 transitions. [2021-11-06 22:12:43,954 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 1827 transitions. Word has length 48 [2021-11-06 22:12:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:43,954 INFO L470 AbstractCegarLoop]: Abstraction has 1610 states and 1827 transitions. [2021-11-06 22:12:43,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1827 transitions. [2021-11-06 22:12:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-06 22:12:43,955 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:43,955 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:43,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 22:12:43,956 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-06 22:12:43,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:43,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1078733087, now seen corresponding path program 1 times [2021-11-06 22:12:43,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:43,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337410031] [2021-11-06 22:12:43,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:43,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:44,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:44,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337410031] [2021-11-06 22:12:44,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337410031] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:44,019 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:44,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:44,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683119683] [2021-11-06 22:12:44,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:44,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:44,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:44,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:44,021 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-06 22:12:44,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:44,116 INFO L93 Difference]: Finished difference Result 2285 states and 2596 transitions. [2021-11-06 22:12:44,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:12:44,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-11-06 22:12:44,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:44,122 INFO L225 Difference]: With dead ends: 2285 [2021-11-06 22:12:44,122 INFO L226 Difference]: Without dead ends: 2281 [2021-11-06 22:12:44,123 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:44,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2021-11-06 22:12:44,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 2145. [2021-11-06 22:12:44,234 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-06 22:12:44,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 2503 transitions. [2021-11-06 22:12:44,238 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 2503 transitions. Word has length 50 [2021-11-06 22:12:44,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:44,239 INFO L470 AbstractCegarLoop]: Abstraction has 2145 states and 2503 transitions. [2021-11-06 22:12:44,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2503 transitions. [2021-11-06 22:12:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-06 22:12:44,240 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:44,240 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:44,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 22:12:44,240 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-06 22:12:44,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:44,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1575530371, now seen corresponding path program 1 times [2021-11-06 22:12:44,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:44,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162036575] [2021-11-06 22:12:44,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:44,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:44,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:44,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:44,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162036575] [2021-11-06 22:12:44,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162036575] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:44,306 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:44,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:44,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892903645] [2021-11-06 22:12:44,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:44,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:44,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:44,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:44,308 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-06 22:12:44,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:44,471 INFO L93 Difference]: Finished difference Result 2806 states and 3234 transitions. [2021-11-06 22:12:44,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:12:44,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-06 22:12:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:44,478 INFO L225 Difference]: With dead ends: 2806 [2021-11-06 22:12:44,479 INFO L226 Difference]: Without dead ends: 2802 [2021-11-06 22:12:44,479 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2021-11-06 22:12:44,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2711. [2021-11-06 22:12:44,581 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-06 22:12:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3148 transitions. [2021-11-06 22:12:44,585 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3148 transitions. Word has length 52 [2021-11-06 22:12:44,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:44,585 INFO L470 AbstractCegarLoop]: Abstraction has 2711 states and 3148 transitions. [2021-11-06 22:12:44,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3148 transitions. [2021-11-06 22:12:44,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 22:12:44,586 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:44,586 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:44,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 22:12:44,587 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:12:44,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:44,587 INFO L85 PathProgramCache]: Analyzing trace with hash 54559857, now seen corresponding path program 1 times [2021-11-06 22:12:44,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:44,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164474789] [2021-11-06 22:12:44,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:44,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:44,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:44,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164474789] [2021-11-06 22:12:44,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164474789] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:44,635 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:44,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:44,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166517997] [2021-11-06 22:12:44,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 22:12:44,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:44,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 22:12:44,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 22:12:44,636 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-06 22:12:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:44,743 INFO L93 Difference]: Finished difference Result 5015 states and 5842 transitions. [2021-11-06 22:12:44,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 22:12:44,744 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-06 22:12:44,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:44,750 INFO L225 Difference]: With dead ends: 5015 [2021-11-06 22:12:44,750 INFO L226 Difference]: Without dead ends: 2839 [2021-11-06 22:12:44,752 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 22:12:44,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2021-11-06 22:12:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2712. [2021-11-06 22:12:44,884 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-06 22:12:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2712 states and 3149 transitions. [2021-11-06 22:12:44,888 INFO L78 Accepts]: Start accepts. Automaton has 2712 states and 3149 transitions. Word has length 53 [2021-11-06 22:12:44,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:44,888 INFO L470 AbstractCegarLoop]: Abstraction has 2712 states and 3149 transitions. [2021-11-06 22:12:44,888 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-06 22:12:44,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 3149 transitions. [2021-11-06 22:12:44,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-06 22:12:44,889 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:44,889 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:44,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 22:12:44,889 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-06 22:12:44,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:44,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2038616505, now seen corresponding path program 1 times [2021-11-06 22:12:44,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:44,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241500395] [2021-11-06 22:12:44,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:44,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:44,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:44,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241500395] [2021-11-06 22:12:44,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241500395] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:44,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:44,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:44,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909052780] [2021-11-06 22:12:44,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:44,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:44,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:44,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:44,954 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-06 22:12:45,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:45,082 INFO L93 Difference]: Finished difference Result 2712 states and 3149 transitions. [2021-11-06 22:12:45,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:45,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-06 22:12:45,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:45,089 INFO L225 Difference]: With dead ends: 2712 [2021-11-06 22:12:45,089 INFO L226 Difference]: Without dead ends: 2708 [2021-11-06 22:12:45,090 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:45,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2021-11-06 22:12:45,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2708. [2021-11-06 22:12:45,207 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-06 22:12:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 3145 transitions. [2021-11-06 22:12:45,210 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 3145 transitions. Word has length 54 [2021-11-06 22:12:45,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:45,211 INFO L470 AbstractCegarLoop]: Abstraction has 2708 states and 3145 transitions. [2021-11-06 22:12:45,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:45,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3145 transitions. [2021-11-06 22:12:45,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-06 22:12:45,212 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:45,212 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:45,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 22:12:45,212 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:12:45,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:45,213 INFO L85 PathProgramCache]: Analyzing trace with hash 377020572, now seen corresponding path program 1 times [2021-11-06 22:12:45,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:45,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212258705] [2021-11-06 22:12:45,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:45,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:45,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:45,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212258705] [2021-11-06 22:12:45,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212258705] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:45,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:45,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:12:45,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613353139] [2021-11-06 22:12:45,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:45,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:45,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:45,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:45,390 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-06 22:12:45,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:45,666 INFO L93 Difference]: Finished difference Result 6618 states and 7728 transitions. [2021-11-06 22:12:45,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:45,667 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-06 22:12:45,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:45,673 INFO L225 Difference]: With dead ends: 6618 [2021-11-06 22:12:45,673 INFO L226 Difference]: Without dead ends: 4259 [2021-11-06 22:12:45,676 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:45,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2021-11-06 22:12:45,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 2594. [2021-11-06 22:12:45,767 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-06 22:12:45,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 3010 transitions. [2021-11-06 22:12:45,770 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 3010 transitions. Word has length 54 [2021-11-06 22:12:45,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:45,770 INFO L470 AbstractCegarLoop]: Abstraction has 2594 states and 3010 transitions. [2021-11-06 22:12:45,771 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-06 22:12:45,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3010 transitions. [2021-11-06 22:12:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-06 22:12:45,771 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:45,771 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:45,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 22:12:45,772 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-06 22:12:45,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:45,772 INFO L85 PathProgramCache]: Analyzing trace with hash -605221525, now seen corresponding path program 1 times [2021-11-06 22:12:45,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:45,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965484478] [2021-11-06 22:12:45,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:45,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:45,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:45,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965484478] [2021-11-06 22:12:45,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965484478] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:45,836 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:45,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:45,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744707538] [2021-11-06 22:12:45,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:45,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:45,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:45,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:45,837 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-06 22:12:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:46,000 INFO L93 Difference]: Finished difference Result 2955 states and 3406 transitions. [2021-11-06 22:12:46,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:12:46,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-06 22:12:46,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:46,005 INFO L225 Difference]: With dead ends: 2955 [2021-11-06 22:12:46,005 INFO L226 Difference]: Without dead ends: 2951 [2021-11-06 22:12:46,005 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:46,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2021-11-06 22:12:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2871. [2021-11-06 22:12:46,106 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-06 22:12:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 3332 transitions. [2021-11-06 22:12:46,109 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 3332 transitions. Word has length 56 [2021-11-06 22:12:46,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:46,109 INFO L470 AbstractCegarLoop]: Abstraction has 2871 states and 3332 transitions. [2021-11-06 22:12:46,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:46,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 3332 transitions. [2021-11-06 22:12:46,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 22:12:46,110 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:46,110 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:46,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 22:12:46,111 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-06 22:12:46,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:46,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1940687920, now seen corresponding path program 1 times [2021-11-06 22:12:46,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:46,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596396554] [2021-11-06 22:12:46,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:46,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:46,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:46,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:46,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596396554] [2021-11-06 22:12:46,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596396554] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 22:12:46,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424087785] [2021-11-06 22:12:46,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:46,167 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:12:46,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:12:46,168 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 22:12:46,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-06 22:12:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:46,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 22:12:46,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 22:12:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:46,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424087785] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 22:12:46,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 22:12:46,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-11-06 22:12:46,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564231952] [2021-11-06 22:12:46,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 22:12:46,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:46,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 22:12:46,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:46,723 INFO L87 Difference]: Start difference. First operand 2871 states and 3332 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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-06 22:12:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:46,926 INFO L93 Difference]: Finished difference Result 5236 states and 6097 transitions. [2021-11-06 22:12:46,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:46,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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 58 [2021-11-06 22:12:46,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:46,932 INFO L225 Difference]: With dead ends: 5236 [2021-11-06 22:12:46,932 INFO L226 Difference]: Without dead ends: 3126 [2021-11-06 22:12:46,934 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2021-11-06 22:12:47,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 2971. [2021-11-06 22:12:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2971 states, 2884 states have (on average 1.2024965325936199) internal successors, (3468), 2970 states have internal predecessors, (3468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 3468 transitions. [2021-11-06 22:12:47,126 INFO L78 Accepts]: Start accepts. Automaton has 2971 states and 3468 transitions. Word has length 58 [2021-11-06 22:12:47,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:47,126 INFO L470 AbstractCegarLoop]: Abstraction has 2971 states and 3468 transitions. [2021-11-06 22:12:47,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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-06 22:12:47,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 3468 transitions. [2021-11-06 22:12:47,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 22:12:47,127 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:47,127 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:47,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-06 22:12:47,347 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-06 22:12:47,347 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-06 22:12:47,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:47,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1797147409, now seen corresponding path program 1 times [2021-11-06 22:12:47,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:47,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920254491] [2021-11-06 22:12:47,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:47,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:47,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:47,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920254491] [2021-11-06 22:12:47,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920254491] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:47,417 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:47,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:47,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382868429] [2021-11-06 22:12:47,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:47,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:47,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:47,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:47,418 INFO L87 Difference]: Start difference. First operand 2971 states and 3468 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:47,571 INFO L93 Difference]: Finished difference Result 2971 states and 3468 transitions. [2021-11-06 22:12:47,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:47,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-06 22:12:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:47,576 INFO L225 Difference]: With dead ends: 2971 [2021-11-06 22:12:47,576 INFO L226 Difference]: Without dead ends: 2967 [2021-11-06 22:12:47,577 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:47,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2021-11-06 22:12:47,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2967. [2021-11-06 22:12:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2967 states, 2882 states have (on average 1.201943095072866) internal successors, (3464), 2966 states have internal predecessors, (3464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2967 states and 3464 transitions. [2021-11-06 22:12:47,691 INFO L78 Accepts]: Start accepts. Automaton has 2967 states and 3464 transitions. Word has length 58 [2021-11-06 22:12:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:47,691 INFO L470 AbstractCegarLoop]: Abstraction has 2967 states and 3464 transitions. [2021-11-06 22:12:47,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:47,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2967 states and 3464 transitions. [2021-11-06 22:12:47,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 22:12:47,692 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:47,692 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:47,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 22:12:47,693 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-06 22:12:47,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:47,693 INFO L85 PathProgramCache]: Analyzing trace with hash 17777306, now seen corresponding path program 1 times [2021-11-06 22:12:47,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:47,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421285138] [2021-11-06 22:12:47,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:47,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:47,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:47,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421285138] [2021-11-06 22:12:47,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421285138] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:47,765 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:47,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:47,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202559277] [2021-11-06 22:12:47,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:47,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:47,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:47,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:47,766 INFO L87 Difference]: Start difference. First operand 2967 states and 3464 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:48,023 INFO L93 Difference]: Finished difference Result 4846 states and 5603 transitions. [2021-11-06 22:12:48,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:12:48,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-06 22:12:48,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:48,030 INFO L225 Difference]: With dead ends: 4846 [2021-11-06 22:12:48,030 INFO L226 Difference]: Without dead ends: 4838 [2021-11-06 22:12:48,031 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:48,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4838 states. [2021-11-06 22:12:48,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4838 to 2961. [2021-11-06 22:12:48,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2961 states, 2879 states have (on average 1.1993747829107329) internal successors, (3453), 2960 states have internal predecessors, (3453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2961 states to 2961 states and 3453 transitions. [2021-11-06 22:12:48,150 INFO L78 Accepts]: Start accepts. Automaton has 2961 states and 3453 transitions. Word has length 59 [2021-11-06 22:12:48,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:48,151 INFO L470 AbstractCegarLoop]: Abstraction has 2961 states and 3453 transitions. [2021-11-06 22:12:48,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:48,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2961 states and 3453 transitions. [2021-11-06 22:12:48,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-06 22:12:48,151 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:48,152 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:48,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 22:12:48,152 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-06 22:12:48,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:48,152 INFO L85 PathProgramCache]: Analyzing trace with hash -481653549, now seen corresponding path program 1 times [2021-11-06 22:12:48,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:48,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328479098] [2021-11-06 22:12:48,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:48,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:48,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:48,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328479098] [2021-11-06 22:12:48,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328479098] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:48,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:48,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:48,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280332822] [2021-11-06 22:12:48,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:48,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:48,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:48,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:48,221 INFO L87 Difference]: Start difference. First operand 2961 states and 3453 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:48,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:48,349 INFO L93 Difference]: Finished difference Result 2961 states and 3453 transitions. [2021-11-06 22:12:48,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:48,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-06 22:12:48,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:48,353 INFO L225 Difference]: With dead ends: 2961 [2021-11-06 22:12:48,353 INFO L226 Difference]: Without dead ends: 2957 [2021-11-06 22:12:48,354 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:48,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2021-11-06 22:12:48,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2957. [2021-11-06 22:12:48,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2957 states, 2877 states have (on average 1.1988182134167535) internal successors, (3449), 2956 states have internal predecessors, (3449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 3449 transitions. [2021-11-06 22:12:48,527 INFO L78 Accepts]: Start accepts. Automaton has 2957 states and 3449 transitions. Word has length 60 [2021-11-06 22:12:48,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:48,527 INFO L470 AbstractCegarLoop]: Abstraction has 2957 states and 3449 transitions. [2021-11-06 22:12:48,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:48,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 3449 transitions. [2021-11-06 22:12:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 22:12:48,528 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:48,528 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:48,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 22:12:48,528 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-06 22:12:48,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:48,529 INFO L85 PathProgramCache]: Analyzing trace with hash -95745666, now seen corresponding path program 1 times [2021-11-06 22:12:48,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:48,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883672281] [2021-11-06 22:12:48,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:48,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:48,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:48,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:48,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883672281] [2021-11-06 22:12:48,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883672281] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:48,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:48,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:48,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183277739] [2021-11-06 22:12:48,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:48,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:48,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:48,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:48,601 INFO L87 Difference]: Start difference. First operand 2957 states and 3449 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:48,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:48,823 INFO L93 Difference]: Finished difference Result 4738 states and 5508 transitions. [2021-11-06 22:12:48,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:48,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-06 22:12:48,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:48,830 INFO L225 Difference]: With dead ends: 4738 [2021-11-06 22:12:48,830 INFO L226 Difference]: Without dead ends: 4720 [2021-11-06 22:12:48,831 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4720 states. [2021-11-06 22:12:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4720 to 2939. [2021-11-06 22:12:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2939 states, 2868 states have (on average 1.1921199442119945) internal successors, (3419), 2938 states have internal predecessors, (3419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 3419 transitions. [2021-11-06 22:12:48,961 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 3419 transitions. Word has length 61 [2021-11-06 22:12:48,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:48,962 INFO L470 AbstractCegarLoop]: Abstraction has 2939 states and 3419 transitions. [2021-11-06 22:12:48,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 3419 transitions. [2021-11-06 22:12:48,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 22:12:48,963 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:48,963 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:48,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 22:12:48,963 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-06 22:12:48,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:48,963 INFO L85 PathProgramCache]: Analyzing trace with hash 987561239, now seen corresponding path program 1 times [2021-11-06 22:12:48,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:48,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026256232] [2021-11-06 22:12:48,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:48,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:49,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:49,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026256232] [2021-11-06 22:12:49,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026256232] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:49,028 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:49,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:49,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728762416] [2021-11-06 22:12:49,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:49,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:49,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:49,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:49,029 INFO L87 Difference]: Start difference. First operand 2939 states and 3419 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-06 22:12:49,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:49,189 INFO L93 Difference]: Finished difference Result 2939 states and 3419 transitions. [2021-11-06 22:12:49,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:49,189 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-06 22:12:49,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:49,193 INFO L225 Difference]: With dead ends: 2939 [2021-11-06 22:12:49,193 INFO L226 Difference]: Without dead ends: 2935 [2021-11-06 22:12:49,193 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:49,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2021-11-06 22:12:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2935. [2021-11-06 22:12:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2935 states, 2866 states have (on average 1.19155617585485) internal successors, (3415), 2934 states have internal predecessors, (3415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:49,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2935 states to 2935 states and 3415 transitions. [2021-11-06 22:12:49,326 INFO L78 Accepts]: Start accepts. Automaton has 2935 states and 3415 transitions. Word has length 62 [2021-11-06 22:12:49,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:49,327 INFO L470 AbstractCegarLoop]: Abstraction has 2935 states and 3415 transitions. [2021-11-06 22:12:49,327 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-06 22:12:49,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2935 states and 3415 transitions. [2021-11-06 22:12:49,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-06 22:12:49,327 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:49,328 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:49,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 22:12:49,328 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:12:49,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:49,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1634040879, now seen corresponding path program 2 times [2021-11-06 22:12:49,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:49,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980109352] [2021-11-06 22:12:49,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:49,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-06 22:12:49,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:49,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980109352] [2021-11-06 22:12:49,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980109352] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:49,390 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:49,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:12:49,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723619628] [2021-11-06 22:12:49,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:49,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:49,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:49,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:49,391 INFO L87 Difference]: Start difference. First operand 2935 states and 3415 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:49,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:49,871 INFO L93 Difference]: Finished difference Result 4460 states and 5166 transitions. [2021-11-06 22:12:49,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:12:49,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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 63 [2021-11-06 22:12:49,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:49,881 INFO L225 Difference]: With dead ends: 4460 [2021-11-06 22:12:49,881 INFO L226 Difference]: Without dead ends: 4452 [2021-11-06 22:12:49,884 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:49,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4452 states. [2021-11-06 22:12:50,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4452 to 2927. [2021-11-06 22:12:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2862 states have (on average 1.1893780573025856) internal successors, (3404), 2926 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:50,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 3404 transitions. [2021-11-06 22:12:50,188 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 3404 transitions. Word has length 63 [2021-11-06 22:12:50,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:50,188 INFO L470 AbstractCegarLoop]: Abstraction has 2927 states and 3404 transitions. [2021-11-06 22:12:50,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 3404 transitions. [2021-11-06 22:12:50,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-06 22:12:50,189 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:50,189 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:50,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 22:12:50,189 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:12:50,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:50,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1817139006, now seen corresponding path program 1 times [2021-11-06 22:12:50,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:50,190 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234657370] [2021-11-06 22:12:50,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:50,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:50,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:50,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234657370] [2021-11-06 22:12:50,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234657370] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:50,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:50,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 22:12:50,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639906049] [2021-11-06 22:12:50,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 22:12:50,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:50,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 22:12:50,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-06 22:12:50,372 INFO L87 Difference]: Start difference. First operand 2927 states and 3404 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-06 22:12:51,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:51,583 INFO L93 Difference]: Finished difference Result 5030 states and 5824 transitions. [2021-11-06 22:12:51,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 22:12:51,586 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-06 22:12:51,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:51,592 INFO L225 Difference]: With dead ends: 5030 [2021-11-06 22:12:51,592 INFO L226 Difference]: Without dead ends: 2776 [2021-11-06 22:12:51,596 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-11-06 22:12:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2021-11-06 22:12:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2440. [2021-11-06 22:12:51,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2385 states have (on average 1.1844863731656186) internal successors, (2825), 2439 states have internal predecessors, (2825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 2825 transitions. [2021-11-06 22:12:51,794 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 2825 transitions. Word has length 63 [2021-11-06 22:12:51,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:51,795 INFO L470 AbstractCegarLoop]: Abstraction has 2440 states and 2825 transitions. [2021-11-06 22:12:51,795 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-06 22:12:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 2825 transitions. [2021-11-06 22:12:51,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 22:12:51,798 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:51,798 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:51,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 22:12:51,798 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:12:51,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:51,799 INFO L85 PathProgramCache]: Analyzing trace with hash -141267525, now seen corresponding path program 1 times [2021-11-06 22:12:51,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:51,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536217155] [2021-11-06 22:12:51,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:51,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:51,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:51,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536217155] [2021-11-06 22:12:51,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536217155] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:51,888 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:51,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:51,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377460653] [2021-11-06 22:12:51,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:51,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:51,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:51,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:51,889 INFO L87 Difference]: Start difference. First operand 2440 states and 2825 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-06 22:12:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:52,018 INFO L93 Difference]: Finished difference Result 2440 states and 2825 transitions. [2021-11-06 22:12:52,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:52,019 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-06 22:12:52,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:52,023 INFO L225 Difference]: With dead ends: 2440 [2021-11-06 22:12:52,023 INFO L226 Difference]: Without dead ends: 2436 [2021-11-06 22:12:52,024 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:52,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2021-11-06 22:12:52,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2436. [2021-11-06 22:12:52,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2436 states, 2383 states have (on average 1.1838019303399077) internal successors, (2821), 2435 states have internal predecessors, (2821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2436 states and 2821 transitions. [2021-11-06 22:12:52,162 INFO L78 Accepts]: Start accepts. Automaton has 2436 states and 2821 transitions. Word has length 64 [2021-11-06 22:12:52,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:52,162 INFO L470 AbstractCegarLoop]: Abstraction has 2436 states and 2821 transitions. [2021-11-06 22:12:52,162 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-06 22:12:52,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 2821 transitions. [2021-11-06 22:12:52,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-06 22:12:52,163 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:52,163 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:52,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-06 22:12:52,163 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:12:52,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:52,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1681016511, now seen corresponding path program 1 times [2021-11-06 22:12:52,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:52,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851118596] [2021-11-06 22:12:52,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:52,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:52,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:52,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851118596] [2021-11-06 22:12:52,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851118596] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:52,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:52,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:52,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495948591] [2021-11-06 22:12:52,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:52,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:52,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:52,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:52,276 INFO L87 Difference]: Start difference. First operand 2436 states and 2821 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-06 22:12:52,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:52,408 INFO L93 Difference]: Finished difference Result 2436 states and 2821 transitions. [2021-11-06 22:12:52,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:52,409 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-06 22:12:52,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:52,414 INFO L225 Difference]: With dead ends: 2436 [2021-11-06 22:12:52,414 INFO L226 Difference]: Without dead ends: 2432 [2021-11-06 22:12:52,415 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2021-11-06 22:12:52,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2432. [2021-11-06 22:12:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2432 states, 2381 states have (on average 1.1831163376732465) internal successors, (2817), 2431 states have internal predecessors, (2817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:52,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 2817 transitions. [2021-11-06 22:12:52,559 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 2817 transitions. Word has length 66 [2021-11-06 22:12:52,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:52,559 INFO L470 AbstractCegarLoop]: Abstraction has 2432 states and 2817 transitions. [2021-11-06 22:12:52,559 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-06 22:12:52,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 2817 transitions. [2021-11-06 22:12:52,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-06 22:12:52,560 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:52,560 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:52,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-06 22:12:52,560 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:12:52,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:52,561 INFO L85 PathProgramCache]: Analyzing trace with hash 549318691, now seen corresponding path program 1 times [2021-11-06 22:12:52,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:52,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138201184] [2021-11-06 22:12:52,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:52,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:52,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:52,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:52,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138201184] [2021-11-06 22:12:52,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138201184] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:52,634 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:52,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:52,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480324644] [2021-11-06 22:12:52,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:52,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:52,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:52,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:52,635 INFO L87 Difference]: Start difference. First operand 2432 states and 2817 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-06 22:12:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:52,774 INFO L93 Difference]: Finished difference Result 2432 states and 2817 transitions. [2021-11-06 22:12:52,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:52,774 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-06 22:12:52,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:52,779 INFO L225 Difference]: With dead ends: 2432 [2021-11-06 22:12:52,780 INFO L226 Difference]: Without dead ends: 2428 [2021-11-06 22:12:52,781 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:52,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2021-11-06 22:12:52,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 2428. [2021-11-06 22:12:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2428 states, 2379 states have (on average 1.1824295922656578) internal successors, (2813), 2427 states have internal predecessors, (2813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:52,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 2813 transitions. [2021-11-06 22:12:52,925 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 2813 transitions. Word has length 68 [2021-11-06 22:12:52,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:52,927 INFO L470 AbstractCegarLoop]: Abstraction has 2428 states and 2813 transitions. [2021-11-06 22:12:52,927 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-06 22:12:52,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 2813 transitions. [2021-11-06 22:12:52,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-06 22:12:52,928 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:52,928 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:52,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 22:12:52,928 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:12:52,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:52,929 INFO L85 PathProgramCache]: Analyzing trace with hash -385560089, now seen corresponding path program 1 times [2021-11-06 22:12:52,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:52,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182355412] [2021-11-06 22:12:52,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:52,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:53,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:53,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182355412] [2021-11-06 22:12:53,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182355412] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:53,021 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:53,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:53,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461780625] [2021-11-06 22:12:53,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:53,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:53,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:53,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:53,022 INFO L87 Difference]: Start difference. First operand 2428 states and 2813 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-06 22:12:53,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:53,157 INFO L93 Difference]: Finished difference Result 2428 states and 2813 transitions. [2021-11-06 22:12:53,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:53,158 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-06 22:12:53,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:53,161 INFO L225 Difference]: With dead ends: 2428 [2021-11-06 22:12:53,161 INFO L226 Difference]: Without dead ends: 2424 [2021-11-06 22:12:53,163 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2021-11-06 22:12:53,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2424. [2021-11-06 22:12:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2424 states, 2377 states have (on average 1.1817416912074044) internal successors, (2809), 2423 states have internal predecessors, (2809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 2809 transitions. [2021-11-06 22:12:53,500 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 2809 transitions. Word has length 70 [2021-11-06 22:12:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:53,501 INFO L470 AbstractCegarLoop]: Abstraction has 2424 states and 2809 transitions. [2021-11-06 22:12:53,501 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-06 22:12:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 2809 transitions. [2021-11-06 22:12:53,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 22:12:53,501 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:53,502 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:53,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-06 22:12:53,502 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:12:53,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:53,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1155902453, now seen corresponding path program 1 times [2021-11-06 22:12:53,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:53,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780991621] [2021-11-06 22:12:53,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:53,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:53,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:53,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780991621] [2021-11-06 22:12:53,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780991621] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:53,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:53,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:53,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282988738] [2021-11-06 22:12:53,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:53,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:53,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:53,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:53,580 INFO L87 Difference]: Start difference. First operand 2424 states and 2809 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-06 22:12:53,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:53,720 INFO L93 Difference]: Finished difference Result 2424 states and 2809 transitions. [2021-11-06 22:12:53,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:12:53,722 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-06 22:12:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:53,726 INFO L225 Difference]: With dead ends: 2424 [2021-11-06 22:12:53,727 INFO L226 Difference]: Without dead ends: 2325 [2021-11-06 22:12:53,728 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:53,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2021-11-06 22:12:53,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2325. [2021-11-06 22:12:53,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2325 states, 2280 states have (on average 1.1859649122807017) internal successors, (2704), 2324 states have internal predecessors, (2704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 2704 transitions. [2021-11-06 22:12:53,865 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 2704 transitions. Word has length 72 [2021-11-06 22:12:53,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:53,866 INFO L470 AbstractCegarLoop]: Abstraction has 2325 states and 2704 transitions. [2021-11-06 22:12:53,866 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-06 22:12:53,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 2704 transitions. [2021-11-06 22:12:53,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-06 22:12:53,867 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:53,867 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:53,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-06 22:12:53,867 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:12:53,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:53,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1562532637, now seen corresponding path program 1 times [2021-11-06 22:12:53,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:53,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137306953] [2021-11-06 22:12:53,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:53,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:53,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:53,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:53,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137306953] [2021-11-06 22:12:53,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137306953] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 22:12:53,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755468804] [2021-11-06 22:12:53,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:53,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:12:53,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:12:53,963 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 22:12:53,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-06 22:12:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:54,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 22:12:54,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 22:12:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:54,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755468804] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:54,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 22:12:54,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-11-06 22:12:54,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73202963] [2021-11-06 22:12:54,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 22:12:54,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:54,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 22:12:54,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-06 22:12:54,746 INFO L87 Difference]: Start difference. First operand 2325 states and 2704 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-06 22:12:55,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:55,257 INFO L93 Difference]: Finished difference Result 4148 states and 4754 transitions. [2021-11-06 22:12:55,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 22:12:55,257 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-06 22:12:55,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:55,263 INFO L225 Difference]: With dead ends: 4148 [2021-11-06 22:12:55,263 INFO L226 Difference]: Without dead ends: 4144 [2021-11-06 22:12:55,264 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-06 22:12:55,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4144 states. [2021-11-06 22:12:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4144 to 2321. [2021-11-06 22:12:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 2278 states have (on average 1.1839332748024582) internal successors, (2697), 2320 states have internal predecessors, (2697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 2697 transitions. [2021-11-06 22:12:55,434 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 2697 transitions. Word has length 78 [2021-11-06 22:12:55,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:55,434 INFO L470 AbstractCegarLoop]: Abstraction has 2321 states and 2697 transitions. [2021-11-06 22:12:55,434 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-06 22:12:55,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 2697 transitions. [2021-11-06 22:12:55,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-06 22:12:55,435 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:55,436 INFO L513 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-06 22:12:55,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-06 22:12:55,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-11-06 22:12:55,670 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:12:55,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:55,670 INFO L85 PathProgramCache]: Analyzing trace with hash 62104588, now seen corresponding path program 1 times [2021-11-06 22:12:55,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:55,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730132811] [2021-11-06 22:12:55,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:55,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:55,808 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-06 22:12:55,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:55,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730132811] [2021-11-06 22:12:55,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730132811] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 22:12:55,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095163974] [2021-11-06 22:12:55,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:55,809 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:12:55,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:12:55,810 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 22:12:55,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-06 22:12:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:56,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 1489 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 22:12:56,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 22:12:56,507 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-06 22:12:56,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095163974] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 22:12:56,508 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 22:12:56,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2021-11-06 22:12:56,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811738099] [2021-11-06 22:12:56,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 22:12:56,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:56,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 22:12:56,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-06 22:12:56,508 INFO L87 Difference]: Start difference. First operand 2321 states and 2697 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-06 22:12:56,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:56,865 INFO L93 Difference]: Finished difference Result 2333 states and 2703 transitions. [2021-11-06 22:12:56,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 22:12:56,866 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-06 22:12:56,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:56,868 INFO L225 Difference]: With dead ends: 2333 [2021-11-06 22:12:56,868 INFO L226 Difference]: Without dead ends: 2321 [2021-11-06 22:12:56,869 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-06 22:12:56,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2021-11-06 22:12:57,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2244. [2021-11-06 22:12:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2244 states, 2207 states have (on average 1.1816946080652468) internal successors, (2608), 2243 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 2608 transitions. [2021-11-06 22:12:57,006 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 2608 transitions. Word has length 97 [2021-11-06 22:12:57,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:57,006 INFO L470 AbstractCegarLoop]: Abstraction has 2244 states and 2608 transitions. [2021-11-06 22:12:57,006 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-06 22:12:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 2608 transitions. [2021-11-06 22:12:57,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-06 22:12:57,008 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:57,008 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:57,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-06 22:12:57,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:12:57,227 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:12:57,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:57,228 INFO L85 PathProgramCache]: Analyzing trace with hash -276917568, now seen corresponding path program 1 times [2021-11-06 22:12:57,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:57,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124446073] [2021-11-06 22:12:57,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:57,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:57,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:57,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124446073] [2021-11-06 22:12:57,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124446073] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:57,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:57,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:57,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797785290] [2021-11-06 22:12:57,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:57,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:57,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:57,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:57,345 INFO L87 Difference]: Start difference. First operand 2244 states and 2608 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-06 22:12:57,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:57,564 INFO L93 Difference]: Finished difference Result 2494 states and 2898 transitions. [2021-11-06 22:12:57,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:12:57,565 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-06 22:12:57,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:57,568 INFO L225 Difference]: With dead ends: 2494 [2021-11-06 22:12:57,568 INFO L226 Difference]: Without dead ends: 2480 [2021-11-06 22:12:57,568 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:57,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2021-11-06 22:12:57,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2230. [2021-11-06 22:12:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 2200 states have (on average 1.175) internal successors, (2585), 2229 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 2585 transitions. [2021-11-06 22:12:57,790 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 2585 transitions. Word has length 120 [2021-11-06 22:12:57,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:57,790 INFO L470 AbstractCegarLoop]: Abstraction has 2230 states and 2585 transitions. [2021-11-06 22:12:57,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 2585 transitions. [2021-11-06 22:12:57,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-06 22:12:57,792 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:57,792 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:57,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-06 22:12:57,792 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr86ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:12:57,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:57,793 INFO L85 PathProgramCache]: Analyzing trace with hash 818410347, now seen corresponding path program 1 times [2021-11-06 22:12:57,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:57,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747761801] [2021-11-06 22:12:57,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:57,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:57,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:57,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747761801] [2021-11-06 22:12:57,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747761801] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:57,861 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:57,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:12:57,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668986194] [2021-11-06 22:12:57,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:57,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:57,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:57,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:57,863 INFO L87 Difference]: Start difference. First operand 2230 states and 2585 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-06 22:12:58,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:58,361 INFO L93 Difference]: Finished difference Result 2760 states and 3207 transitions. [2021-11-06 22:12:58,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:12:58,362 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-06 22:12:58,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:58,365 INFO L225 Difference]: With dead ends: 2760 [2021-11-06 22:12:58,365 INFO L226 Difference]: Without dead ends: 2746 [2021-11-06 22:12:58,366 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:58,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2021-11-06 22:12:58,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2216. [2021-11-06 22:12:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2216 states, 2193 states have (on average 1.1682626538987688) internal successors, (2562), 2215 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 2562 transitions. [2021-11-06 22:12:58,557 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 2562 transitions. Word has length 128 [2021-11-06 22:12:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:58,558 INFO L470 AbstractCegarLoop]: Abstraction has 2216 states and 2562 transitions. [2021-11-06 22:12:58,558 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-06 22:12:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2562 transitions. [2021-11-06 22:12:58,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-06 22:12:58,560 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:58,560 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:58,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-06 22:12:58,560 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-06 22:12:58,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:58,561 INFO L85 PathProgramCache]: Analyzing trace with hash 124270850, now seen corresponding path program 1 times [2021-11-06 22:12:58,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:58,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813020803] [2021-11-06 22:12:58,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:58,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:58,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:58,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:58,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813020803] [2021-11-06 22:12:58,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813020803] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:58,637 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:58,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 22:12:58,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037980910] [2021-11-06 22:12:58,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 22:12:58,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:58,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 22:12:58,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:58,639 INFO L87 Difference]: Start difference. First operand 2216 states and 2562 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-06 22:12:59,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:59,060 INFO L93 Difference]: Finished difference Result 6508 states and 7603 transitions. [2021-11-06 22:12:59,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 22:12:59,061 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-06 22:12:59,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:59,066 INFO L225 Difference]: With dead ends: 6508 [2021-11-06 22:12:59,066 INFO L226 Difference]: Without dead ends: 5333 [2021-11-06 22:12:59,068 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 22:12:59,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5333 states. [2021-11-06 22:12:59,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5333 to 2243. [2021-11-06 22:12:59,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2243 states, 2220 states have (on average 1.1657657657657658) internal successors, (2588), 2242 states have internal predecessors, (2588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:59,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 2588 transitions. [2021-11-06 22:12:59,291 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 2588 transitions. Word has length 143 [2021-11-06 22:12:59,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:59,291 INFO L470 AbstractCegarLoop]: Abstraction has 2243 states and 2588 transitions. [2021-11-06 22:12:59,291 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-06 22:12:59,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 2588 transitions. [2021-11-06 22:12:59,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-06 22:12:59,293 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:59,293 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:59,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-06 22:12:59,293 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:12:59,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:59,294 INFO L85 PathProgramCache]: Analyzing trace with hash -268756160, now seen corresponding path program 1 times [2021-11-06 22:12:59,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:59,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786647350] [2021-11-06 22:12:59,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:59,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:59,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:59,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786647350] [2021-11-06 22:12:59,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786647350] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:59,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:59,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:59,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998001229] [2021-11-06 22:12:59,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:59,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:59,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:59,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:59,398 INFO L87 Difference]: Start difference. First operand 2243 states and 2588 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-06 22:12:59,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:12:59,681 INFO L93 Difference]: Finished difference Result 3184 states and 3683 transitions. [2021-11-06 22:12:59,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:12:59,681 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-06 22:12:59,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:12:59,684 INFO L225 Difference]: With dead ends: 3184 [2021-11-06 22:12:59,685 INFO L226 Difference]: Without dead ends: 3182 [2021-11-06 22:12:59,685 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:12:59,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2021-11-06 22:12:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 2243. [2021-11-06 22:12:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2243 states, 2220 states have (on average 1.164864864864865) internal successors, (2586), 2242 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:12:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 2586 transitions. [2021-11-06 22:12:59,851 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 2586 transitions. Word has length 143 [2021-11-06 22:12:59,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:12:59,851 INFO L470 AbstractCegarLoop]: Abstraction has 2243 states and 2586 transitions. [2021-11-06 22:12:59,851 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-06 22:12:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 2586 transitions. [2021-11-06 22:12:59,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-06 22:12:59,853 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:12:59,853 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:12:59,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-06 22:12:59,853 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr90ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:12:59,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:12:59,854 INFO L85 PathProgramCache]: Analyzing trace with hash -576382556, now seen corresponding path program 1 times [2021-11-06 22:12:59,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:12:59,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896208657] [2021-11-06 22:12:59,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:12:59,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:12:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:12:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:12:59,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:12:59,973 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896208657] [2021-11-06 22:12:59,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896208657] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:12:59,973 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:12:59,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:12:59,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950195721] [2021-11-06 22:12:59,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:12:59,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:12:59,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:12:59,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:12:59,975 INFO L87 Difference]: Start difference. First operand 2243 states and 2586 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-06 22:13:00,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:13:00,237 INFO L93 Difference]: Finished difference Result 3193 states and 3699 transitions. [2021-11-06 22:13:00,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:13:00,237 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-06 22:13:00,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:13:00,240 INFO L225 Difference]: With dead ends: 3193 [2021-11-06 22:13:00,240 INFO L226 Difference]: Without dead ends: 2983 [2021-11-06 22:13:00,242 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:13:00,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2021-11-06 22:13:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 2033. [2021-11-06 22:13:00,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2033 states, 2016 states have (on average 1.1651785714285714) internal successors, (2349), 2032 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:13:00,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 2349 transitions. [2021-11-06 22:13:00,404 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 2349 transitions. Word has length 145 [2021-11-06 22:13:00,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:13:00,405 INFO L470 AbstractCegarLoop]: Abstraction has 2033 states and 2349 transitions. [2021-11-06 22:13:00,405 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-06 22:13:00,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2349 transitions. [2021-11-06 22:13:00,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-06 22:13:00,407 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:13:00,407 INFO L513 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-06 22:13:00,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-06 22:13:00,407 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-06 22:13:00,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:13:00,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1455645263, now seen corresponding path program 1 times [2021-11-06 22:13:00,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:13:00,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531099449] [2021-11-06 22:13:00,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:00,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:13:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:13:00,709 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-06 22:13:00,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:13:00,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531099449] [2021-11-06 22:13:00,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531099449] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:13:00,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:13:00,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:13:00,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842863874] [2021-11-06 22:13:00,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:13:00,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:13:00,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:13:00,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:13:00,712 INFO L87 Difference]: Start difference. First operand 2033 states and 2349 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-06 22:13:00,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:13:00,987 INFO L93 Difference]: Finished difference Result 4003 states and 4630 transitions. [2021-11-06 22:13:00,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:13:00,988 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-06 22:13:00,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:13:00,990 INFO L225 Difference]: With dead ends: 4003 [2021-11-06 22:13:00,990 INFO L226 Difference]: Without dead ends: 2033 [2021-11-06 22:13:00,993 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:13:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2021-11-06 22:13:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2033. [2021-11-06 22:13:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2033 states, 2016 states have (on average 1.1636904761904763) internal successors, (2346), 2032 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:13:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 2346 transitions. [2021-11-06 22:13:01,153 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 2346 transitions. Word has length 163 [2021-11-06 22:13:01,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:13:01,154 INFO L470 AbstractCegarLoop]: Abstraction has 2033 states and 2346 transitions. [2021-11-06 22:13:01,154 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-06 22:13:01,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2346 transitions. [2021-11-06 22:13:01,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-11-06 22:13:01,156 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:13:01,156 INFO L513 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-06 22:13:01,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-06 22:13:01,156 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr87ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:13:01,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:13:01,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1894922186, now seen corresponding path program 1 times [2021-11-06 22:13:01,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:13:01,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193324503] [2021-11-06 22:13:01,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:01,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:13:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:13:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-06 22:13:01,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:13:01,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193324503] [2021-11-06 22:13:01,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193324503] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 22:13:01,460 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721253155] [2021-11-06 22:13:01,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:01,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:13:01,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:13:01,461 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 22:13:01,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-06 22:13:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:13:02,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 2140 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 22:13:02,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 22:13:02,561 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-06 22:13:02,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721253155] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 22:13:02,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 22:13:02,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-11-06 22:13:02,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24669943] [2021-11-06 22:13:02,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 22:13:02,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:13:02,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 22:13:02,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-06 22:13:02,563 INFO L87 Difference]: Start difference. First operand 2033 states and 2346 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-06 22:13:03,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:13:03,230 INFO L93 Difference]: Finished difference Result 2919 states and 3387 transitions. [2021-11-06 22:13:03,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 22:13:03,231 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-06 22:13:03,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:13:03,235 INFO L225 Difference]: With dead ends: 2919 [2021-11-06 22:13:03,235 INFO L226 Difference]: Without dead ends: 2907 [2021-11-06 22:13:03,236 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 178 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-06 22:13:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2021-11-06 22:13:03,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2021. [2021-11-06 22:13:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2021 states, 2010 states have (on average 1.1577114427860697) internal successors, (2327), 2020 states have internal predecessors, (2327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:13:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 2327 transitions. [2021-11-06 22:13:03,421 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 2327 transitions. Word has length 181 [2021-11-06 22:13:03,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:13:03,421 INFO L470 AbstractCegarLoop]: Abstraction has 2021 states and 2327 transitions. [2021-11-06 22:13:03,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:13:03,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2327 transitions. [2021-11-06 22:13:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-11-06 22:13:03,424 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:13:03,424 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:13:03,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-06 22:13:03,643 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,SelfDestructingSolverStorable38 [2021-11-06 22:13:03,644 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:13:03,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:13:03,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1722921435, now seen corresponding path program 1 times [2021-11-06 22:13:03,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:13:03,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777216053] [2021-11-06 22:13:03,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:03,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:13:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:13:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-06 22:13:03,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:13:03,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777216053] [2021-11-06 22:13:03,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777216053] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 22:13:03,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455103811] [2021-11-06 22:13:03,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:03,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:13:03,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:13:03,892 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 22:13:03,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-06 22:13:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:13:04,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 2114 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 22:13:04,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 22:13:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-06 22:13:05,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455103811] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 22:13:05,135 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 22:13:05,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-11-06 22:13:05,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711387715] [2021-11-06 22:13:05,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 22:13:05,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:13:05,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 22:13:05,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-06 22:13:05,136 INFO L87 Difference]: Start difference. First operand 2021 states and 2327 transitions. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:13:05,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:13:05,726 INFO L93 Difference]: Finished difference Result 2021 states and 2327 transitions. [2021-11-06 22:13:05,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:13:05,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2021-11-06 22:13:05,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:13:05,729 INFO L225 Difference]: With dead ends: 2021 [2021-11-06 22:13:05,729 INFO L226 Difference]: Without dead ends: 1786 [2021-11-06 22:13:05,730 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 189 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-06 22:13:05,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2021-11-06 22:13:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1779. [2021-11-06 22:13:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1769 states have (on average 1.1644997173544376) internal successors, (2060), 1778 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:13:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2060 transitions. [2021-11-06 22:13:05,876 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2060 transitions. Word has length 192 [2021-11-06 22:13:05,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:13:05,877 INFO L470 AbstractCegarLoop]: Abstraction has 1779 states and 2060 transitions. [2021-11-06 22:13:05,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:13:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2060 transitions. [2021-11-06 22:13:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-11-06 22:13:05,878 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:13:05,879 INFO L513 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-06 22:13:05,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-06 22:13:06,091 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,SelfDestructingSolverStorable39 [2021-11-06 22:13:06,092 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-06 22:13:06,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:13:06,092 INFO L85 PathProgramCache]: Analyzing trace with hash -766877368, now seen corresponding path program 1 times [2021-11-06 22:13:06,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:13:06,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051458774] [2021-11-06 22:13:06,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:06,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:13:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:13:06,167 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-06 22:13:06,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:13:06,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051458774] [2021-11-06 22:13:06,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051458774] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:13:06,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:13:06,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:13:06,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657364626] [2021-11-06 22:13:06,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 22:13:06,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:13:06,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 22:13:06,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 22:13:06,169 INFO L87 Difference]: Start difference. First operand 1779 states and 2060 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-06 22:13:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:13:06,464 INFO L93 Difference]: Finished difference Result 5123 states and 5924 transitions. [2021-11-06 22:13:06,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 22:13:06,464 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-06 22:13:06,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:13:06,469 INFO L225 Difference]: With dead ends: 5123 [2021-11-06 22:13:06,470 INFO L226 Difference]: Without dead ends: 3403 [2021-11-06 22:13:06,475 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 22:13:06,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2021-11-06 22:13:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 1782. [2021-11-06 22:13:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1772 states have (on average 1.1642212189616252) internal successors, (2063), 1781 states have internal predecessors, (2063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:13:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2063 transitions. [2021-11-06 22:13:06,655 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2063 transitions. Word has length 194 [2021-11-06 22:13:06,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:13:06,655 INFO L470 AbstractCegarLoop]: Abstraction has 1782 states and 2063 transitions. [2021-11-06 22:13:06,656 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-06 22:13:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2063 transitions. [2021-11-06 22:13:06,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-11-06 22:13:06,657 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:13:06,657 INFO L513 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-06 22:13:06,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-06 22:13:06,658 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-06 22:13:06,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:13:06,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1714929334, now seen corresponding path program 1 times [2021-11-06 22:13:06,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:13:06,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768835851] [2021-11-06 22:13:06,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:06,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:13:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:13:06,780 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-06 22:13:06,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:13:06,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768835851] [2021-11-06 22:13:06,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768835851] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:13:06,781 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:13:06,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:13:06,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782301146] [2021-11-06 22:13:06,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:13:06,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:13:06,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:13:06,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:13:06,782 INFO L87 Difference]: Start difference. First operand 1782 states and 2063 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-06 22:13:07,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:13:07,266 INFO L93 Difference]: Finished difference Result 4863 states and 5632 transitions. [2021-11-06 22:13:07,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:13:07,266 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-06 22:13:07,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:13:07,271 INFO L225 Difference]: With dead ends: 4863 [2021-11-06 22:13:07,271 INFO L226 Difference]: Without dead ends: 3140 [2021-11-06 22:13:07,274 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:13:07,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3140 states. [2021-11-06 22:13:07,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3140 to 1760. [2021-11-06 22:13:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1750 states have (on average 1.1588571428571428) internal successors, (2028), 1759 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-06 22:13:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2028 transitions. [2021-11-06 22:13:07,466 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2028 transitions. Word has length 194 [2021-11-06 22:13:07,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:13:07,466 INFO L470 AbstractCegarLoop]: Abstraction has 1760 states and 2028 transitions. [2021-11-06 22:13:07,466 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-06 22:13:07,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2028 transitions. [2021-11-06 22:13:07,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-11-06 22:13:07,468 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:13:07,469 INFO L513 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-06 22:13:07,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-06 22:13:07,469 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-06 22:13:07,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:13:07,469 INFO L85 PathProgramCache]: Analyzing trace with hash 217813787, now seen corresponding path program 1 times [2021-11-06 22:13:07,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:13:07,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492115724] [2021-11-06 22:13:07,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:07,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:13:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:13:07,639 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-06 22:13:07,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:13:07,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492115724] [2021-11-06 22:13:07,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492115724] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:13:07,640 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:13:07,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 22:13:07,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762346105] [2021-11-06 22:13:07,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 22:13:07,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:13:07,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 22:13:07,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 22:13:07,641 INFO L87 Difference]: Start difference. First operand 1760 states and 2028 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-06 22:13:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:13:08,247 INFO L93 Difference]: Finished difference Result 5694 states and 6611 transitions. [2021-11-06 22:13:08,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 22:13:08,248 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-06 22:13:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:13:08,253 INFO L225 Difference]: With dead ends: 5694 [2021-11-06 22:13:08,253 INFO L226 Difference]: Without dead ends: 4570 [2021-11-06 22:13:08,255 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-06 22:13:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4570 states. [2021-11-06 22:13:08,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4570 to 1778. [2021-11-06 22:13:08,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1768 states have (on average 1.157239819004525) internal successors, (2046), 1777 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:13:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2046 transitions. [2021-11-06 22:13:08,454 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2046 transitions. Word has length 218 [2021-11-06 22:13:08,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:13:08,454 INFO L470 AbstractCegarLoop]: Abstraction has 1778 states and 2046 transitions. [2021-11-06 22:13:08,454 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-06 22:13:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2046 transitions. [2021-11-06 22:13:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2021-11-06 22:13:08,456 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:13:08,456 INFO L513 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-06 22:13:08,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-06 22:13:08,457 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:13:08,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:13:08,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1399097338, now seen corresponding path program 1 times [2021-11-06 22:13:08,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:13:08,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225063175] [2021-11-06 22:13:08,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:08,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:13:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:13:08,813 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-06 22:13:08,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:13:08,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225063175] [2021-11-06 22:13:08,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225063175] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 22:13:08,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38957327] [2021-11-06 22:13:08,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:08,813 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:13:08,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:13:08,820 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 22:13:08,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-06 22:13:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:13:09,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 2498 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 22:13:09,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 22:13:10,154 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-06 22:13:10,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38957327] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:13:10,154 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 22:13:10,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2021-11-06 22:13:10,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177663496] [2021-11-06 22:13:10,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 22:13:10,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:13:10,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 22:13:10,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-06 22:13:10,155 INFO L87 Difference]: Start difference. First operand 1778 states and 2046 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-06 22:13:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:13:10,890 INFO L93 Difference]: Finished difference Result 2680 states and 3103 transitions. [2021-11-06 22:13:10,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 22:13:10,890 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-06 22:13:10,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:13:10,903 INFO L225 Difference]: With dead ends: 2680 [2021-11-06 22:13:10,904 INFO L226 Difference]: Without dead ends: 2668 [2021-11-06 22:13:10,905 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-11-06 22:13:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2021-11-06 22:13:11,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 1766. [2021-11-06 22:13:11,143 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-06 22:13:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2028 transitions. [2021-11-06 22:13:11,145 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2028 transitions. Word has length 220 [2021-11-06 22:13:11,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:13:11,145 INFO L470 AbstractCegarLoop]: Abstraction has 1766 states and 2028 transitions. [2021-11-06 22:13:11,145 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-06 22:13:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2028 transitions. [2021-11-06 22:13:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2021-11-06 22:13:11,147 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:13:11,148 INFO L513 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-06 22:13:11,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-06 22:13:11,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:13:11,360 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-06 22:13:11,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:13:11,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1126999311, now seen corresponding path program 1 times [2021-11-06 22:13:11,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:13:11,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439655250] [2021-11-06 22:13:11,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:11,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:13:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:13:11,536 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-06 22:13:11,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:13:11,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439655250] [2021-11-06 22:13:11,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439655250] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:13:11,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:13:11,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:13:11,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136251245] [2021-11-06 22:13:11,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 22:13:11,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:13:11,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 22:13:11,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 22:13:11,539 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-06 22:13:11,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:13:11,810 INFO L93 Difference]: Finished difference Result 3512 states and 4064 transitions. [2021-11-06 22:13:11,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 22:13:11,811 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-06 22:13:11,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:13:11,814 INFO L225 Difference]: With dead ends: 3512 [2021-11-06 22:13:11,814 INFO L226 Difference]: Without dead ends: 2382 [2021-11-06 22:13:11,816 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 22:13:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2021-11-06 22:13:12,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 1870. [2021-11-06 22:13:12,055 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-06 22:13:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2156 transitions. [2021-11-06 22:13:12,058 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2156 transitions. Word has length 247 [2021-11-06 22:13:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:13:12,058 INFO L470 AbstractCegarLoop]: Abstraction has 1870 states and 2156 transitions. [2021-11-06 22:13:12,058 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-06 22:13:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2156 transitions. [2021-11-06 22:13:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2021-11-06 22:13:12,061 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:13:12,061 INFO L513 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-06 22:13:12,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-06 22:13:12,062 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:13:12,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:13:12,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1650451, now seen corresponding path program 1 times [2021-11-06 22:13:12,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:13:12,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810795819] [2021-11-06 22:13:12,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:12,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:13:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:13:12,236 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-06 22:13:12,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:13:12,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810795819] [2021-11-06 22:13:12,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810795819] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:13:12,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:13:12,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:13:12,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864703056] [2021-11-06 22:13:12,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 22:13:12,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:13:12,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 22:13:12,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:13:12,238 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-06 22:13:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:13:12,529 INFO L93 Difference]: Finished difference Result 3670 states and 4269 transitions. [2021-11-06 22:13:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 22:13:12,530 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-06 22:13:12,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:13:12,532 INFO L225 Difference]: With dead ends: 3670 [2021-11-06 22:13:12,533 INFO L226 Difference]: Without dead ends: 2436 [2021-11-06 22:13:12,534 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 22:13:12,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2021-11-06 22:13:12,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 1870. [2021-11-06 22:13:12,738 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-06 22:13:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2154 transitions. [2021-11-06 22:13:12,739 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2154 transitions. Word has length 250 [2021-11-06 22:13:12,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:13:12,740 INFO L470 AbstractCegarLoop]: Abstraction has 1870 states and 2154 transitions. [2021-11-06 22:13:12,740 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-06 22:13:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2154 transitions. [2021-11-06 22:13:12,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2021-11-06 22:13:12,742 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:13:12,742 INFO L513 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-06 22:13:12,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-06 22:13:12,742 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:13:12,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:13:12,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1710033, now seen corresponding path program 1 times [2021-11-06 22:13:12,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:13:12,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154642319] [2021-11-06 22:13:12,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:12,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:13:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:13:12,838 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-06 22:13:12,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:13:12,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154642319] [2021-11-06 22:13:12,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154642319] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:13:12,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:13:12,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:13:12,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204808943] [2021-11-06 22:13:12,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:13:12,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:13:12,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:13:12,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:13:12,841 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-06 22:13:13,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:13:13,126 INFO L93 Difference]: Finished difference Result 2439 states and 2821 transitions. [2021-11-06 22:13:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:13:13,126 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-06 22:13:13,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:13:13,129 INFO L225 Difference]: With dead ends: 2439 [2021-11-06 22:13:13,129 INFO L226 Difference]: Without dead ends: 2437 [2021-11-06 22:13:13,130 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:13:13,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2021-11-06 22:13:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1868. [2021-11-06 22:13:13,362 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-06 22:13:13,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2151 transitions. [2021-11-06 22:13:13,364 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2151 transitions. Word has length 250 [2021-11-06 22:13:13,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:13:13,364 INFO L470 AbstractCegarLoop]: Abstraction has 1868 states and 2151 transitions. [2021-11-06 22:13:13,364 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-06 22:13:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2151 transitions. [2021-11-06 22:13:13,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2021-11-06 22:13:13,366 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:13:13,366 INFO L513 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-06 22:13:13,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-06 22:13:13,367 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-06 22:13:13,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:13:13,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1851659248, now seen corresponding path program 1 times [2021-11-06 22:13:13,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:13:13,367 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336845936] [2021-11-06 22:13:13,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:13,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:13:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:13:13,650 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-06 22:13:13,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:13:13,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336845936] [2021-11-06 22:13:13,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336845936] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:13:13,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:13:13,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:13:13,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346397796] [2021-11-06 22:13:13,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 22:13:13,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:13:13,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 22:13:13,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:13:13,652 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-06 22:13:14,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:13:14,086 INFO L93 Difference]: Finished difference Result 1868 states and 2151 transitions. [2021-11-06 22:13:14,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:13:14,087 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-06 22:13:14,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:13:14,088 INFO L225 Difference]: With dead ends: 1868 [2021-11-06 22:13:14,088 INFO L226 Difference]: Without dead ends: 1736 [2021-11-06 22:13:14,090 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 22:13:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2021-11-06 22:13:14,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1549. [2021-11-06 22:13:14,269 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-06 22:13:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 1798 transitions. [2021-11-06 22:13:14,270 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 1798 transitions. Word has length 250 [2021-11-06 22:13:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:13:14,271 INFO L470 AbstractCegarLoop]: Abstraction has 1549 states and 1798 transitions. [2021-11-06 22:13:14,271 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-06 22:13:14,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1798 transitions. [2021-11-06 22:13:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-11-06 22:13:14,272 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:13:14,272 INFO L513 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-06 22:13:14,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-06 22:13:14,273 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-06 22:13:14,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:13:14,273 INFO L85 PathProgramCache]: Analyzing trace with hash -589682853, now seen corresponding path program 1 times [2021-11-06 22:13:14,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:13:14,273 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161010813] [2021-11-06 22:13:14,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:14,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:13:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:13:14,416 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-06 22:13:14,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:13:14,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161010813] [2021-11-06 22:13:14,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161010813] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:13:14,416 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:13:14,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 22:13:14,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080112254] [2021-11-06 22:13:14,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 22:13:14,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:13:14,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 22:13:14,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 22:13:14,418 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-06 22:13:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:13:14,598 INFO L93 Difference]: Finished difference Result 2645 states and 3088 transitions. [2021-11-06 22:13:14,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 22:13:14,598 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-06 22:13:14,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:13:14,600 INFO L225 Difference]: With dead ends: 2645 [2021-11-06 22:13:14,600 INFO L226 Difference]: Without dead ends: 1545 [2021-11-06 22:13:14,601 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 22:13:14,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2021-11-06 22:13:14,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1545. [2021-11-06 22:13:14,806 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-06 22:13:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1791 transitions. [2021-11-06 22:13:14,807 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1791 transitions. Word has length 253 [2021-11-06 22:13:14,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:13:14,807 INFO L470 AbstractCegarLoop]: Abstraction has 1545 states and 1791 transitions. [2021-11-06 22:13:14,808 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-06 22:13:14,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1791 transitions. [2021-11-06 22:13:14,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2021-11-06 22:13:14,810 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:13:14,810 INFO L513 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-06 22:13:14,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-06 22:13:14,810 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:13:14,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:13:14,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1539343555, now seen corresponding path program 1 times [2021-11-06 22:13:14,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:13:14,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677505464] [2021-11-06 22:13:14,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:14,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:13:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:13:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-06 22:13:14,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:13:14,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677505464] [2021-11-06 22:13:14,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677505464] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:13:14,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:13:14,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:13:14,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254270112] [2021-11-06 22:13:14,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 22:13:14,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:13:14,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 22:13:14,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 22:13:14,927 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-06 22:13:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:13:15,228 INFO L93 Difference]: Finished difference Result 3533 states and 4135 transitions. [2021-11-06 22:13:15,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 22:13:15,229 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-06 22:13:15,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:13:15,231 INFO L225 Difference]: With dead ends: 3533 [2021-11-06 22:13:15,231 INFO L226 Difference]: Without dead ends: 2437 [2021-11-06 22:13:15,232 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 22:13:15,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2021-11-06 22:13:15,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1547. [2021-11-06 22:13:15,419 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-06 22:13:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 1793 transitions. [2021-11-06 22:13:15,420 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 1793 transitions. Word has length 345 [2021-11-06 22:13:15,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:13:15,421 INFO L470 AbstractCegarLoop]: Abstraction has 1547 states and 1793 transitions. [2021-11-06 22:13:15,421 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-06 22:13:15,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1793 transitions. [2021-11-06 22:13:15,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2021-11-06 22:13:15,423 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:13:15,423 INFO L513 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-06 22:13:15,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-06 22:13:15,423 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:13:15,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:13:15,424 INFO L85 PathProgramCache]: Analyzing trace with hash 396841089, now seen corresponding path program 1 times [2021-11-06 22:13:15,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:13:15,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358272939] [2021-11-06 22:13:15,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:15,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:13:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:13:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-06 22:13:15,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:13:15,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358272939] [2021-11-06 22:13:15,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358272939] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:13:15,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:13:15,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 22:13:15,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027714450] [2021-11-06 22:13:15,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 22:13:15,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:13:15,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 22:13:15,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 22:13:15,613 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-06 22:13:16,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:13:16,308 INFO L93 Difference]: Finished difference Result 4573 states and 5355 transitions. [2021-11-06 22:13:16,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 22:13:16,309 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-06 22:13:16,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:13:16,312 INFO L225 Difference]: With dead ends: 4573 [2021-11-06 22:13:16,312 INFO L226 Difference]: Without dead ends: 3475 [2021-11-06 22:13:16,314 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-06 22:13:16,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3475 states. [2021-11-06 22:13:16,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3475 to 1559. [2021-11-06 22:13:16,528 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-06 22:13:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 1805 transitions. [2021-11-06 22:13:16,529 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 1805 transitions. Word has length 345 [2021-11-06 22:13:16,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:13:16,529 INFO L470 AbstractCegarLoop]: Abstraction has 1559 states and 1805 transitions. [2021-11-06 22:13:16,530 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-06 22:13:16,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1805 transitions. [2021-11-06 22:13:16,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2021-11-06 22:13:16,532 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:13:16,532 INFO L513 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-06 22:13:16,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-06 22:13:16,532 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:13:16,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:13:16,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1610548403, now seen corresponding path program 1 times [2021-11-06 22:13:16,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:13:16,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723147673] [2021-11-06 22:13:16,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:16,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:13:16,575 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 22:13:16,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [223382289] [2021-11-06 22:13:16,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:16,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:13:16,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:13:16,576 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 22:13:16,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-06 22:13:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:13:17,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 3475 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-06 22:13:17,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 22:13:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-06 22:13:18,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:13:18,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723147673] [2021-11-06 22:13:18,240 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 22:13:18,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223382289] [2021-11-06 22:13:18,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223382289] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:13:18,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:13:18,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 22:13:18,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772305699] [2021-11-06 22:13:18,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 22:13:18,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:13:18,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 22:13:18,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 22:13:18,241 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-06 22:13:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:13:18,799 INFO L93 Difference]: Finished difference Result 3732 states and 4354 transitions. [2021-11-06 22:13:18,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 22:13:18,800 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-06 22:13:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:13:18,803 INFO L225 Difference]: With dead ends: 3732 [2021-11-06 22:13:18,803 INFO L226 Difference]: Without dead ends: 3114 [2021-11-06 22:13:18,804 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-11-06 22:13:18,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2021-11-06 22:13:19,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 1562. [2021-11-06 22:13:19,061 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-06 22:13:19,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 1808 transitions. [2021-11-06 22:13:19,062 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 1808 transitions. Word has length 351 [2021-11-06 22:13:19,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:13:19,063 INFO L470 AbstractCegarLoop]: Abstraction has 1562 states and 1808 transitions. [2021-11-06 22:13:19,063 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-06 22:13:19,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1808 transitions. [2021-11-06 22:13:19,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2021-11-06 22:13:19,065 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:13:19,065 INFO L513 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-06 22:13:19,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-06 22:13:19,273 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-06 22:13:19,273 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:13:19,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:13:19,274 INFO L85 PathProgramCache]: Analyzing trace with hash 91074321, now seen corresponding path program 1 times [2021-11-06 22:13:19,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:13:19,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111886370] [2021-11-06 22:13:19,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:19,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:13:19,329 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 22:13:19,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478209490] [2021-11-06 22:13:19,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:19,330 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:13:19,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:13:19,331 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 22:13:19,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-06 22:13:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:13:21,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 3624 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-06 22:13:21,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 22:13:22,157 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-06 22:13:22,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2021-11-06 22:13:22,210 INFO L354 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2021-11-06 22:13:22,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 55 [2021-11-06 22:13:23,233 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-11-06 22:13:23,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2021-11-06 22:13:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 22:13:23,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:13:23,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111886370] [2021-11-06 22:13:23,512 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 22:13:23,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478209490] [2021-11-06 22:13:23,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478209490] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 22:13:23,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-06 22:13:23,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2021-11-06 22:13:23,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003305198] [2021-11-06 22:13:23,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 22:13:23,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:13:23,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 22:13:23,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-06 22:13:23,513 INFO L87 Difference]: Start difference. First operand 1562 states and 1808 transitions. Second operand has 11 states, 11 states have (on average 32.63636363636363) internal successors, (359), 10 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:13:43,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:13:43,980 INFO L93 Difference]: Finished difference Result 3300 states and 3807 transitions. [2021-11-06 22:13:43,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 22:13:43,981 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 32.63636363636363) internal successors, (359), 10 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 363 [2021-11-06 22:13:43,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:13:43,984 INFO L225 Difference]: With dead ends: 3300 [2021-11-06 22:13:43,984 INFO L226 Difference]: Without dead ends: 1739 [2021-11-06 22:13:43,986 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2021-11-06 22:13:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2021-11-06 22:13:44,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1621. [2021-11-06 22:13:44,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 1620 states have (on average 1.1549382716049383) internal successors, (1871), 1620 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:13:44,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 1871 transitions. [2021-11-06 22:13:44,227 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 1871 transitions. Word has length 363 [2021-11-06 22:13:44,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:13:44,228 INFO L470 AbstractCegarLoop]: Abstraction has 1621 states and 1871 transitions. [2021-11-06 22:13:44,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.63636363636363) internal successors, (359), 10 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:13:44,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1871 transitions. [2021-11-06 22:13:44,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2021-11-06 22:13:44,230 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:13:44,230 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:13:44,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-11-06 22:13:44,445 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-06 22:13:44,446 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:13:44,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:13:44,447 INFO L85 PathProgramCache]: Analyzing trace with hash -360849989, now seen corresponding path program 1 times [2021-11-06 22:13:44,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:13:44,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310724304] [2021-11-06 22:13:44,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:44,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:13:44,524 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 22:13:44,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1639282759] [2021-11-06 22:13:44,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:13:44,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:13:44,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:13:44,531 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 22:13:44,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-06 22:15:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:15:50,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 3776 conjuncts, 97 conjunts are in the unsatisfiable core [2021-11-06 22:15:50,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 22:15:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-06 22:15:52,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:15:52,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310724304] [2021-11-06 22:15:52,056 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 22:15:52,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639282759] [2021-11-06 22:15:52,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639282759] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:15:52,056 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:15:52,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-06 22:15:52,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196276550] [2021-11-06 22:15:52,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-06 22:15:52,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:15:52,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-06 22:15:52,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2021-11-06 22:15:52,059 INFO L87 Difference]: Start difference. First operand 1621 states and 1871 transitions. Second operand has 20 states, 20 states have (on average 18.5) internal successors, (370), 20 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:15:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:15:58,588 INFO L93 Difference]: Finished difference Result 7609 states and 8891 transitions. [2021-11-06 22:15:58,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-11-06 22:15:58,590 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 18.5) internal successors, (370), 20 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 384 [2021-11-06 22:15:58,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:15:58,598 INFO L225 Difference]: With dead ends: 7609 [2021-11-06 22:15:58,598 INFO L226 Difference]: Without dead ends: 6496 [2021-11-06 22:15:58,601 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1360, Invalid=3896, Unknown=0, NotChecked=0, Total=5256 [2021-11-06 22:15:58,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2021-11-06 22:15:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 1629. [2021-11-06 22:15:58,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1628 states have (on average 1.154176904176904) internal successors, (1879), 1628 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:15:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 1879 transitions. [2021-11-06 22:15:58,926 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 1879 transitions. Word has length 384 [2021-11-06 22:15:58,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:15:58,927 INFO L470 AbstractCegarLoop]: Abstraction has 1629 states and 1879 transitions. [2021-11-06 22:15:58,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 18.5) internal successors, (370), 20 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:15:58,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 1879 transitions. [2021-11-06 22:15:58,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2021-11-06 22:15:58,929 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:15:58,929 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:15:58,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-11-06 22:15:59,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:15:59,156 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:15:59,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:15:59,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1524261605, now seen corresponding path program 1 times [2021-11-06 22:15:59,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:15:59,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387779562] [2021-11-06 22:15:59,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:15:59,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:15:59,216 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 22:15:59,216 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1320255870] [2021-11-06 22:15:59,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:15:59,216 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:15:59,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:15:59,218 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 22:15:59,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-06 22:16:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:16:05,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 3780 conjuncts, 56 conjunts are in the unsatisfiable core [2021-11-06 22:16:05,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 22:16:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-06 22:16:06,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:16:06,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387779562] [2021-11-06 22:16:06,657 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 22:16:06,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320255870] [2021-11-06 22:16:06,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320255870] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:16:06,657 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:16:06,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 22:16:06,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781521019] [2021-11-06 22:16:06,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 22:16:06,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:16:06,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 22:16:06,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2021-11-06 22:16:06,658 INFO L87 Difference]: Start difference. First operand 1629 states and 1879 transitions. Second operand has 13 states, 13 states have (on average 28.615384615384617) internal successors, (372), 13 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:16:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:16:09,496 INFO L93 Difference]: Finished difference Result 8181 states and 9587 transitions. [2021-11-06 22:16:09,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 22:16:09,496 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 28.615384615384617) internal successors, (372), 13 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 386 [2021-11-06 22:16:09,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:16:09,506 INFO L225 Difference]: With dead ends: 8181 [2021-11-06 22:16:09,506 INFO L226 Difference]: Without dead ends: 7060 [2021-11-06 22:16:09,509 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=532, Unknown=0, NotChecked=0, Total=756 [2021-11-06 22:16:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7060 states. [2021-11-06 22:16:09,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7060 to 1813. [2021-11-06 22:16:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 1812 states have (on average 1.151766004415011) internal successors, (2087), 1812 states have internal predecessors, (2087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:16:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2087 transitions. [2021-11-06 22:16:09,925 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2087 transitions. Word has length 386 [2021-11-06 22:16:09,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:16:09,926 INFO L470 AbstractCegarLoop]: Abstraction has 1813 states and 2087 transitions. [2021-11-06 22:16:09,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 28.615384615384617) internal successors, (372), 13 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:16:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2087 transitions. [2021-11-06 22:16:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2021-11-06 22:16:09,929 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:16:09,929 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:16:09,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-06 22:16:10,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2021-11-06 22:16:10,156 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:16:10,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:16:10,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1248260265, now seen corresponding path program 1 times [2021-11-06 22:16:10,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:16:10,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49285035] [2021-11-06 22:16:10,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:16:10,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:16:10,240 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 22:16:10,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682992524] [2021-11-06 22:16:10,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:16:10,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:16:10,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:16:10,252 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 22:16:10,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-06 22:17:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:17:19,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 3787 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-06 22:17:19,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 22:17:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-06 22:17:20,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:17:20,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49285035] [2021-11-06 22:17:20,426 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 22:17:20,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682992524] [2021-11-06 22:17:20,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682992524] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:17:20,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:17:20,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 22:17:20,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339431480] [2021-11-06 22:17:20,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 22:17:20,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:17:20,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 22:17:20,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 22:17:20,427 INFO L87 Difference]: Start difference. First operand 1813 states and 2087 transitions. Second operand has 6 states, 6 states have (on average 63.333333333333336) internal successors, (380), 6 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:17:23,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:17:23,800 INFO L93 Difference]: Finished difference Result 8526 states and 9972 transitions. [2021-11-06 22:17:23,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 22:17:23,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 63.333333333333336) internal successors, (380), 6 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 394 [2021-11-06 22:17:23,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:17:23,810 INFO L225 Difference]: With dead ends: 8526 [2021-11-06 22:17:23,810 INFO L226 Difference]: Without dead ends: 7221 [2021-11-06 22:17:23,813 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-06 22:17:23,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7221 states. [2021-11-06 22:17:24,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7221 to 1681. [2021-11-06 22:17:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1680 states have (on average 1.1553571428571427) internal successors, (1941), 1680 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:17:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 1941 transitions. [2021-11-06 22:17:24,205 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 1941 transitions. Word has length 394 [2021-11-06 22:17:24,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:17:24,205 INFO L470 AbstractCegarLoop]: Abstraction has 1681 states and 1941 transitions. [2021-11-06 22:17:24,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.333333333333336) internal successors, (380), 6 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:17:24,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 1941 transitions. [2021-11-06 22:17:24,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2021-11-06 22:17:24,208 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:17:24,208 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:17:24,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-11-06 22:17:24,435 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-06 22:17:24,436 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:17:24,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:17:24,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1517041101, now seen corresponding path program 1 times [2021-11-06 22:17:24,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:17:24,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070691611] [2021-11-06 22:17:24,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:17:24,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:17:24,494 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 22:17:24,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1144391974] [2021-11-06 22:17:24,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:17:24,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:17:24,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:17:24,496 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 22:17:24,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-06 22:17:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:17:26,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 3823 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 22:17:26,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 22:17:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-06 22:17:26,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:17:26,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070691611] [2021-11-06 22:17:26,936 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 22:17:26,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144391974] [2021-11-06 22:17:26,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144391974] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:17:26,936 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:17:26,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 22:17:26,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057600668] [2021-11-06 22:17:26,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 22:17:26,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:17:26,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 22:17:26,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:17:26,937 INFO L87 Difference]: Start difference. First operand 1681 states and 1941 transitions. Second operand has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:17:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:17:27,970 INFO L93 Difference]: Finished difference Result 4995 states and 5826 transitions. [2021-11-06 22:17:27,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:17:27,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 398 [2021-11-06 22:17:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:17:27,976 INFO L225 Difference]: With dead ends: 4995 [2021-11-06 22:17:27,976 INFO L226 Difference]: Without dead ends: 3822 [2021-11-06 22:17:27,978 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 22:17:27,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2021-11-06 22:17:28,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 1681. [2021-11-06 22:17:28,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1680 states have (on average 1.151190476190476) internal successors, (1934), 1680 states have internal predecessors, (1934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:17:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 1934 transitions. [2021-11-06 22:17:28,355 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 1934 transitions. Word has length 398 [2021-11-06 22:17:28,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:17:28,355 INFO L470 AbstractCegarLoop]: Abstraction has 1681 states and 1934 transitions. [2021-11-06 22:17:28,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:17:28,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 1934 transitions. [2021-11-06 22:17:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2021-11-06 22:17:28,358 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:17:28,358 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:17:28,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-06 22:17:28,562 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-06 22:17:28,563 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:17:28,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:17:28,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2045958769, now seen corresponding path program 1 times [2021-11-06 22:17:28,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:17:28,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922196942] [2021-11-06 22:17:28,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:17:28,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:17:28,621 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 22:17:28,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1025200382] [2021-11-06 22:17:28,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:17:28,622 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:17:28,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:17:28,623 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 22:17:28,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-06 22:17:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:17:49,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 3822 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-06 22:17:49,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 22:17:50,035 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-06 22:17:50,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:17:50,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922196942] [2021-11-06 22:17:50,035 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 22:17:50,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025200382] [2021-11-06 22:17:50,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025200382] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:17:50,035 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:17:50,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:17:50,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714709172] [2021-11-06 22:17:50,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:17:50,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:17:50,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:17:50,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:17:50,036 INFO L87 Difference]: Start difference. First operand 1681 states and 1934 transitions. Second operand has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:17:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:17:51,315 INFO L93 Difference]: Finished difference Result 5943 states and 6850 transitions. [2021-11-06 22:17:51,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:17:51,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 398 [2021-11-06 22:17:51,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:17:51,322 INFO L225 Difference]: With dead ends: 5943 [2021-11-06 22:17:51,323 INFO L226 Difference]: Without dead ends: 4770 [2021-11-06 22:17:51,325 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:17:51,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4770 states. [2021-11-06 22:17:51,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4770 to 1693. [2021-11-06 22:17:51,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1692 states have (on average 1.1501182033096926) internal successors, (1946), 1692 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:17:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 1946 transitions. [2021-11-06 22:17:51,735 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 1946 transitions. Word has length 398 [2021-11-06 22:17:51,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:17:51,735 INFO L470 AbstractCegarLoop]: Abstraction has 1693 states and 1946 transitions. [2021-11-06 22:17:51,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:17:51,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 1946 transitions. [2021-11-06 22:17:51,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2021-11-06 22:17:51,738 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:17:51,738 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:17:51,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-11-06 22:17:51,940 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-06 22:17:51,941 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-06 22:17:51,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:17:51,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1503971249, now seen corresponding path program 1 times [2021-11-06 22:17:51,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:17:51,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254119766] [2021-11-06 22:17:51,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:17:51,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:17:51,993 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 22:17:51,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [343871422] [2021-11-06 22:17:51,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:17:51,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:17:51,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:17:51,995 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 22:17:51,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process Killed by 15