./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--rose--rose.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5f08f0f0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.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 1a40e66604094f312102b838d8c965fbe1879fb2092ea49e39f812ee4cfee256 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-05 23:59:16,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-05 23:59:16,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-05 23:59:16,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-05 23:59:16,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-05 23:59:16,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-05 23:59:16,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-05 23:59:16,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-05 23:59:16,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-05 23:59:16,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-05 23:59:16,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-05 23:59:16,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-05 23:59:16,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-05 23:59:16,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-05 23:59:16,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-05 23:59:16,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-05 23:59:16,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-05 23:59:16,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-05 23:59:16,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-05 23:59:16,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-05 23:59:16,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-05 23:59:16,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-05 23:59:16,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-05 23:59:16,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-05 23:59:16,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-05 23:59:16,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-05 23:59:16,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-05 23:59:16,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-05 23:59:16,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-05 23:59:16,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-05 23:59:16,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-05 23:59:16,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-05 23:59:16,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-05 23:59:16,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-05 23:59:16,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-05 23:59:16,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-05 23:59:16,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-05 23:59:16,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-05 23:59:16,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-05 23:59:16,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-05 23:59:16,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-05 23:59:16,878 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-05 23:59:16,904 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-05 23:59:16,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-05 23:59:16,905 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-05 23:59:16,905 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-05 23:59:16,906 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-05 23:59:16,907 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-05 23:59:16,907 INFO L138 SettingsManager]: * Use SBE=true [2021-11-05 23:59:16,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-05 23:59:16,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-05 23:59:16,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-05 23:59:16,908 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-05 23:59:16,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-05 23:59:16,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-05 23:59:16,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-05 23:59:16,908 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-05 23:59:16,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-05 23:59:16,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-05 23:59:16,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-05 23:59:16,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-05 23:59:16,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 23:59:16,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-05 23:59:16,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-05 23:59:16,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-05 23:59:16,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-05 23:59:16,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-05 23:59:16,910 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-05 23:59:16,910 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-05 23:59:16,910 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-05 23:59:16,910 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-05 23:59:16,911 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 -> 1a40e66604094f312102b838d8c965fbe1879fb2092ea49e39f812ee4cfee256 [2021-11-05 23:59:17,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-05 23:59:17,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-05 23:59:17,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-05 23:59:17,195 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-05 23:59:17,195 INFO L275 PluginConnector]: CDTParser initialized [2021-11-05 23:59:17,196 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--rose--rose.ko.cil.i [2021-11-05 23:59:17,245 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5fcf73e6/9e5dbdd8fbb14df0bd1085e188d4a0e7/FLAG18afe0940 [2021-11-05 23:59:18,060 INFO L306 CDTParser]: Found 1 translation units. [2021-11-05 23:59:18,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i [2021-11-05 23:59:18,111 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5fcf73e6/9e5dbdd8fbb14df0bd1085e188d4a0e7/FLAG18afe0940 [2021-11-05 23:59:18,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5fcf73e6/9e5dbdd8fbb14df0bd1085e188d4a0e7 [2021-11-05 23:59:18,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-05 23:59:18,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-05 23:59:18,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-05 23:59:18,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-05 23:59:18,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-05 23:59:18,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:59:18" (1/1) ... [2021-11-05 23:59:18,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c77083f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:59:18, skipping insertion in model container [2021-11-05 23:59:18,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:59:18" (1/1) ... [2021-11-05 23:59:18,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-05 23:59:18,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-05 23:59:25,271 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680431,680444] [2021-11-05 23:59:25,274 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680576,680589] [2021-11-05 23:59:25,274 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680722,680735] [2021-11-05 23:59:25,275 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680887,680900] [2021-11-05 23:59:25,275 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681045,681058] [2021-11-05 23:59:25,275 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681203,681216] [2021-11-05 23:59:25,276 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681361,681374] [2021-11-05 23:59:25,276 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681521,681534] [2021-11-05 23:59:25,276 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681680,681693] [2021-11-05 23:59:25,277 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681819,681832] [2021-11-05 23:59:25,277 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681961,681974] [2021-11-05 23:59:25,277 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682110,682123] [2021-11-05 23:59:25,278 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682249,682262] [2021-11-05 23:59:25,278 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682404,682417] [2021-11-05 23:59:25,278 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682564,682577] [2021-11-05 23:59:25,279 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682715,682728] [2021-11-05 23:59:25,279 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682866,682879] [2021-11-05 23:59:25,284 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683018,683031] [2021-11-05 23:59:25,287 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683167,683180] [2021-11-05 23:59:25,288 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683315,683328] [2021-11-05 23:59:25,289 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683472,683485] [2021-11-05 23:59:25,289 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683621,683634] [2021-11-05 23:59:25,290 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683777,683790] [2021-11-05 23:59:25,290 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683930,683943] [2021-11-05 23:59:25,290 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684076,684089] [2021-11-05 23:59:25,292 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684219,684232] [2021-11-05 23:59:25,293 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684371,684384] [2021-11-05 23:59:25,295 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684517,684530] [2021-11-05 23:59:25,295 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684662,684675] [2021-11-05 23:59:25,295 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684816,684829] [2021-11-05 23:59:25,296 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684967,684980] [2021-11-05 23:59:25,297 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685122,685135] [2021-11-05 23:59:25,297 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685274,685287] [2021-11-05 23:59:25,298 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685429,685442] [2021-11-05 23:59:25,298 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685593,685606] [2021-11-05 23:59:25,298 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685749,685762] [2021-11-05 23:59:25,299 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685913,685926] [2021-11-05 23:59:25,300 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686055,686068] [2021-11-05 23:59:25,300 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686213,686226] [2021-11-05 23:59:25,300 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686380,686393] [2021-11-05 23:59:25,301 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686539,686552] [2021-11-05 23:59:25,301 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686698,686711] [2021-11-05 23:59:25,301 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686847,686860] [2021-11-05 23:59:25,302 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686994,687007] [2021-11-05 23:59:25,302 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687133,687146] [2021-11-05 23:59:25,302 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687296,687309] [2021-11-05 23:59:25,302 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687462,687475] [2021-11-05 23:59:25,303 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687626,687639] [2021-11-05 23:59:25,304 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687791,687804] [2021-11-05 23:59:25,304 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687956,687969] [2021-11-05 23:59:25,305 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688122,688135] [2021-11-05 23:59:25,305 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688287,688300] [2021-11-05 23:59:25,305 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688454,688467] [2021-11-05 23:59:25,305 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688614,688627] [2021-11-05 23:59:25,306 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688776,688789] [2021-11-05 23:59:25,306 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688935,688948] [2021-11-05 23:59:25,306 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689081,689094] [2021-11-05 23:59:25,307 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689224,689237] [2021-11-05 23:59:25,307 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689368,689381] [2021-11-05 23:59:25,307 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689511,689524] [2021-11-05 23:59:25,307 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689655,689668] [2021-11-05 23:59:25,308 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689796,689809] [2021-11-05 23:59:25,308 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689934,689947] [2021-11-05 23:59:25,309 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690092,690105] [2021-11-05 23:59:25,309 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690251,690264] [2021-11-05 23:59:25,309 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690407,690420] [2021-11-05 23:59:25,310 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690556,690569] [2021-11-05 23:59:25,310 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690708,690721] [2021-11-05 23:59:25,310 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690859,690872] [2021-11-05 23:59:25,310 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691008,691021] [2021-11-05 23:59:25,311 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691160,691173] [2021-11-05 23:59:25,311 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691308,691321] [2021-11-05 23:59:25,311 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691461,691474] [2021-11-05 23:59:25,311 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691612,691625] [2021-11-05 23:59:25,312 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691762,691775] [2021-11-05 23:59:25,312 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691909,691922] [2021-11-05 23:59:25,312 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692060,692073] [2021-11-05 23:59:25,313 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692211,692224] [2021-11-05 23:59:25,313 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692359,692372] [2021-11-05 23:59:25,313 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692525,692538] [2021-11-05 23:59:25,314 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692694,692707] [2021-11-05 23:59:25,314 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692861,692874] [2021-11-05 23:59:25,315 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693029,693042] [2021-11-05 23:59:25,315 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693179,693192] [2021-11-05 23:59:25,315 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693326,693339] [2021-11-05 23:59:25,316 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693487,693500] [2021-11-05 23:59:25,316 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693657,693670] [2021-11-05 23:59:25,316 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693819,693832] [2021-11-05 23:59:25,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 23:59:25,393 INFO L203 MainTranslator]: Completed pre-run [2021-11-05 23:59:26,202 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680431,680444] [2021-11-05 23:59:26,204 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680576,680589] [2021-11-05 23:59:26,206 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680722,680735] [2021-11-05 23:59:26,207 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680887,680900] [2021-11-05 23:59:26,207 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681045,681058] [2021-11-05 23:59:26,208 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681203,681216] [2021-11-05 23:59:26,209 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681361,681374] [2021-11-05 23:59:26,209 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681521,681534] [2021-11-05 23:59:26,210 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681680,681693] [2021-11-05 23:59:26,210 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681819,681832] [2021-11-05 23:59:26,211 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681961,681974] [2021-11-05 23:59:26,211 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682110,682123] [2021-11-05 23:59:26,211 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682249,682262] [2021-11-05 23:59:26,212 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682404,682417] [2021-11-05 23:59:26,212 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682564,682577] [2021-11-05 23:59:26,213 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682715,682728] [2021-11-05 23:59:26,213 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682866,682879] [2021-11-05 23:59:26,213 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683018,683031] [2021-11-05 23:59:26,213 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683167,683180] [2021-11-05 23:59:26,214 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683315,683328] [2021-11-05 23:59:26,214 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683472,683485] [2021-11-05 23:59:26,214 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683621,683634] [2021-11-05 23:59:26,214 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683777,683790] [2021-11-05 23:59:26,215 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683930,683943] [2021-11-05 23:59:26,215 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684076,684089] [2021-11-05 23:59:26,215 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684219,684232] [2021-11-05 23:59:26,215 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684371,684384] [2021-11-05 23:59:26,216 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684517,684530] [2021-11-05 23:59:26,216 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684662,684675] [2021-11-05 23:59:26,216 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684816,684829] [2021-11-05 23:59:26,216 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684967,684980] [2021-11-05 23:59:26,217 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685122,685135] [2021-11-05 23:59:26,217 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685274,685287] [2021-11-05 23:59:26,217 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685429,685442] [2021-11-05 23:59:26,217 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685593,685606] [2021-11-05 23:59:26,218 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685749,685762] [2021-11-05 23:59:26,218 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685913,685926] [2021-11-05 23:59:26,218 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686055,686068] [2021-11-05 23:59:26,218 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686213,686226] [2021-11-05 23:59:26,219 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686380,686393] [2021-11-05 23:59:26,219 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686539,686552] [2021-11-05 23:59:26,219 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686698,686711] [2021-11-05 23:59:26,219 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686847,686860] [2021-11-05 23:59:26,220 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686994,687007] [2021-11-05 23:59:26,220 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687133,687146] [2021-11-05 23:59:26,220 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687296,687309] [2021-11-05 23:59:26,220 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687462,687475] [2021-11-05 23:59:26,221 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687626,687639] [2021-11-05 23:59:26,221 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687791,687804] [2021-11-05 23:59:26,221 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687956,687969] [2021-11-05 23:59:26,221 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688122,688135] [2021-11-05 23:59:26,222 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688287,688300] [2021-11-05 23:59:26,222 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688454,688467] [2021-11-05 23:59:26,222 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688614,688627] [2021-11-05 23:59:26,222 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688776,688789] [2021-11-05 23:59:26,222 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688935,688948] [2021-11-05 23:59:26,223 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689081,689094] [2021-11-05 23:59:26,223 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689224,689237] [2021-11-05 23:59:26,223 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689368,689381] [2021-11-05 23:59:26,223 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689511,689524] [2021-11-05 23:59:26,224 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689655,689668] [2021-11-05 23:59:26,224 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689796,689809] [2021-11-05 23:59:26,224 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689934,689947] [2021-11-05 23:59:26,224 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690092,690105] [2021-11-05 23:59:26,225 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690251,690264] [2021-11-05 23:59:26,225 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690407,690420] [2021-11-05 23:59:26,225 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690556,690569] [2021-11-05 23:59:26,225 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690708,690721] [2021-11-05 23:59:26,226 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690859,690872] [2021-11-05 23:59:26,226 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691008,691021] [2021-11-05 23:59:26,226 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691160,691173] [2021-11-05 23:59:26,226 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691308,691321] [2021-11-05 23:59:26,227 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691461,691474] [2021-11-05 23:59:26,227 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691612,691625] [2021-11-05 23:59:26,227 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691762,691775] [2021-11-05 23:59:26,227 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691909,691922] [2021-11-05 23:59:26,228 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692060,692073] [2021-11-05 23:59:26,228 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692211,692224] [2021-11-05 23:59:26,228 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692359,692372] [2021-11-05 23:59:26,228 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692525,692538] [2021-11-05 23:59:26,229 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692694,692707] [2021-11-05 23:59:26,229 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692861,692874] [2021-11-05 23:59:26,229 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693029,693042] [2021-11-05 23:59:26,229 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693179,693192] [2021-11-05 23:59:26,229 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693326,693339] [2021-11-05 23:59:26,230 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693487,693500] [2021-11-05 23:59:26,230 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693657,693670] [2021-11-05 23:59:26,230 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693819,693832] [2021-11-05 23:59:26,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 23:59:26,537 INFO L208 MainTranslator]: Completed translation [2021-11-05 23:59:26,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:59:26 WrapperNode [2021-11-05 23:59:26,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-05 23:59:26,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-05 23:59:26,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-05 23:59:26,539 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-05 23:59:26,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:59:26" (1/1) ... [2021-11-05 23:59:26,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:59:26" (1/1) ... [2021-11-05 23:59:29,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-05 23:59:29,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-05 23:59:29,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-05 23:59:29,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-05 23:59:29,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:59:26" (1/1) ... [2021-11-05 23:59:29,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:59:26" (1/1) ... [2021-11-05 23:59:30,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:59:26" (1/1) ... [2021-11-05 23:59:30,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:59:26" (1/1) ... [2021-11-05 23:59:31,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:59:26" (1/1) ... [2021-11-05 23:59:32,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:59:26" (1/1) ... [2021-11-05 23:59:32,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:59:26" (1/1) ... [2021-11-05 23:59:32,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-05 23:59:32,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-05 23:59:32,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-05 23:59:32,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-05 23:59:32,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:59:26" (1/1) ... [2021-11-05 23:59:32,915 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 23:59:32,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 23:59:32,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-05 23:59:32,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-05 23:59:32,966 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-05 23:59:32,967 INFO L130 BoogieDeclarations]: Found specification of procedure sock_wfree [2021-11-05 23:59:32,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-05 23:59:32,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-05 23:59:32,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-05 23:59:32,967 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-05 23:59:32,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-05 23:59:32,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-05 23:59:32,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-05 23:59:32,968 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_size_call_parameter [2021-11-05 23:59:32,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-05 23:59:32,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-05 23:59:32,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-05 23:59:32,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-05 23:59:32,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-05 23:59:32,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-05 23:59:32,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-05 23:59:32,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-05 23:59:32,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 00:04:13,333 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-06 00:04:13,337 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L11799: #t~ret2561 := main_#res; [2021-11-06 00:04:13,337 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_27_returnLabel: main_#res := 0; [2021-11-06 00:04:13,387 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 00:04:13,387 INFO L299 CfgBuilder]: Removed 23684 assume(true) statements. [2021-11-06 00:04:13,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:04:13 BoogieIcfgContainer [2021-11-06 00:04:13,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 00:04:13,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 00:04:13,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 00:04:13,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 00:04:13,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 11:59:18" (1/3) ... [2021-11-06 00:04:13,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f1d464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:04:13, skipping insertion in model container [2021-11-06 00:04:13,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:59:26" (2/3) ... [2021-11-06 00:04:13,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f1d464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:04:13, skipping insertion in model container [2021-11-06 00:04:13,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:04:13" (3/3) ... [2021-11-06 00:04:13,417 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--rose--rose.ko.cil.i [2021-11-06 00:04:13,422 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 00:04:13,423 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 539 error locations. [2021-11-06 00:04:13,514 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 00:04:13,520 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 00:04:13,521 INFO L340 AbstractCegarLoop]: Starting to check reachability of 539 error locations. [2021-11-06 00:04:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 23274 states, 22735 states have (on average 1.391818781614251) internal successors, (31643), 23273 states have internal predecessors, (31643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:13,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-06 00:04:13,820 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:04:13,820 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:04:13,821 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-06 00:04:13,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:04:13,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1421350192, now seen corresponding path program 1 times [2021-11-06 00:04:13,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:04:13,831 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176108773] [2021-11-06 00:04:13,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:04:13,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:04:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:04:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:04:14,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:04:14,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176108773] [2021-11-06 00:04:14,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176108773] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:04:14,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:04:14,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:04:14,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571089444] [2021-11-06 00:04:14,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:04:14,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:04:14,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:04:14,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:04:14,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:04:14,655 INFO L87 Difference]: Start difference. First operand has 23274 states, 22735 states have (on average 1.391818781614251) internal successors, (31643), 23273 states have internal predecessors, (31643), 0 states have call successors, (0), 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 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:04:21,589 INFO L93 Difference]: Finished difference Result 54177 states and 73821 transitions. [2021-11-06 00:04:21,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 00:04:21,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-06 00:04:21,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:04:21,724 INFO L225 Difference]: With dead ends: 54177 [2021-11-06 00:04:21,724 INFO L226 Difference]: Without dead ends: 28622 [2021-11-06 00:04:21,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 194.35ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 00:04:21,790 INFO L933 BasicCegarLoop]: 40847 mSDtfsCounter, 71356 mSDsluCounter, 44219 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5227.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 71356 SdHoareTripleChecker+Valid, 85066 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 119.09ms SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5670.40ms IncrementalHoareTripleChecker+Time [2021-11-06 00:04:21,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71356 Valid, 85066 Invalid, 1569 Unknown, 0 Unchecked, 119.09ms Time], IncrementalHoareTripleChecker [481 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 5670.40ms Time] [2021-11-06 00:04:21,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28622 states. [2021-11-06 00:04:22,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28622 to 21517. [2021-11-06 00:04:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21517 states, 20978 states have (on average 1.3083706740394698) internal successors, (27447), 21516 states have internal predecessors, (27447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21517 states to 21517 states and 27447 transitions. [2021-11-06 00:04:22,623 INFO L78 Accepts]: Start accepts. Automaton has 21517 states and 27447 transitions. Word has length 12 [2021-11-06 00:04:22,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:04:22,624 INFO L470 AbstractCegarLoop]: Abstraction has 21517 states and 27447 transitions. [2021-11-06 00:04:22,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 21517 states and 27447 transitions. [2021-11-06 00:04:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-06 00:04:22,629 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:04:22,629 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:04:22,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 00:04:22,630 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-06 00:04:22,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:04:22,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1421290610, now seen corresponding path program 1 times [2021-11-06 00:04:22,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:04:22,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241845604] [2021-11-06 00:04:22,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:04:22,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:04:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:04:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:04:22,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:04:22,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241845604] [2021-11-06 00:04:22,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241845604] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:04:22,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:04:22,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:04:22,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008728294] [2021-11-06 00:04:22,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:04:22,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:04:22,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:04:22,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:04:22,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:04:22,956 INFO L87 Difference]: Start difference. First operand 21517 states and 27447 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:04:29,599 INFO L93 Difference]: Finished difference Result 34483 states and 44247 transitions. [2021-11-06 00:04:29,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 00:04:29,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-06 00:04:29,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:04:29,669 INFO L225 Difference]: With dead ends: 34483 [2021-11-06 00:04:29,670 INFO L226 Difference]: Without dead ends: 34101 [2021-11-06 00:04:29,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 82.16ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:04:29,683 INFO L933 BasicCegarLoop]: 40365 mSDtfsCounter, 56089 mSDsluCounter, 26155 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 766 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5166.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 56089 SdHoareTripleChecker+Valid, 66520 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 161.86ms SdHoareTripleChecker+Time, 766 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5605.52ms IncrementalHoareTripleChecker+Time [2021-11-06 00:04:29,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56089 Valid, 66520 Invalid, 1805 Unknown, 0 Unchecked, 161.86ms Time], IncrementalHoareTripleChecker [766 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 5605.52ms Time] [2021-11-06 00:04:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34101 states. [2021-11-06 00:04:30,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34101 to 21383. [2021-11-06 00:04:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21383 states, 20973 states have (on average 1.3022934248796072) internal successors, (27313), 21382 states have internal predecessors, (27313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21383 states to 21383 states and 27313 transitions. [2021-11-06 00:04:30,375 INFO L78 Accepts]: Start accepts. Automaton has 21383 states and 27313 transitions. Word has length 12 [2021-11-06 00:04:30,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:04:30,376 INFO L470 AbstractCegarLoop]: Abstraction has 21383 states and 27313 transitions. [2021-11-06 00:04:30,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 21383 states and 27313 transitions. [2021-11-06 00:04:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-06 00:04:30,377 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:04:30,377 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:04:30,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 00:04:30,377 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-06 00:04:30,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:04:30,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1877009153, now seen corresponding path program 1 times [2021-11-06 00:04:30,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:04:30,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421236529] [2021-11-06 00:04:30,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:04:30,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:04:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:04:30,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:04:30,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:04:30,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421236529] [2021-11-06 00:04:30,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421236529] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:04:30,608 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:04:30,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 00:04:30,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149291512] [2021-11-06 00:04:30,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:04:30,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 00:04:30,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:04:30,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 00:04:30,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:04:30,609 INFO L87 Difference]: Start difference. First operand 21383 states and 27313 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:32,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:04:32,294 INFO L93 Difference]: Finished difference Result 42180 states and 54037 transitions. [2021-11-06 00:04:32,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:04:32,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-06 00:04:32,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:04:32,340 INFO L225 Difference]: With dead ends: 42180 [2021-11-06 00:04:32,340 INFO L226 Difference]: Without dead ends: 20810 [2021-11-06 00:04:32,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.17ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:04:32,374 INFO L933 BasicCegarLoop]: 26234 mSDtfsCounter, 26413 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1100.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26413 SdHoareTripleChecker+Valid, 26234 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 30.79ms SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1176.64ms IncrementalHoareTripleChecker+Time [2021-11-06 00:04:32,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26413 Valid, 26234 Invalid, 381 Unknown, 0 Unchecked, 30.79ms Time], IncrementalHoareTripleChecker [190 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 1176.64ms Time] [2021-11-06 00:04:32,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20810 states. [2021-11-06 00:04:32,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20810 to 20810. [2021-11-06 00:04:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20810 states, 20591 states have (on average 1.289349715895294) internal successors, (26549), 20809 states have internal predecessors, (26549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:33,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20810 states to 20810 states and 26549 transitions. [2021-11-06 00:04:33,009 INFO L78 Accepts]: Start accepts. Automaton has 20810 states and 26549 transitions. Word has length 15 [2021-11-06 00:04:33,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:04:33,010 INFO L470 AbstractCegarLoop]: Abstraction has 20810 states and 26549 transitions. [2021-11-06 00:04:33,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:33,010 INFO L276 IsEmpty]: Start isEmpty. Operand 20810 states and 26549 transitions. [2021-11-06 00:04:33,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-06 00:04:33,011 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:04:33,011 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:04:33,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 00:04:33,011 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-06 00:04:33,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:04:33,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1646240705, now seen corresponding path program 1 times [2021-11-06 00:04:33,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:04:33,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804864032] [2021-11-06 00:04:33,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:04:33,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:04:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:04:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:04:33,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:04:33,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804864032] [2021-11-06 00:04:33,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804864032] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:04:33,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:04:33,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:04:33,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447256744] [2021-11-06 00:04:33,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:04:33,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:04:33,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:04:33,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:04:33,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:04:33,290 INFO L87 Difference]: Start difference. First operand 20810 states and 26549 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:33,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:04:33,843 INFO L93 Difference]: Finished difference Result 20810 states and 26549 transitions. [2021-11-06 00:04:33,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:04:33,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-06 00:04:33,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:04:33,884 INFO L225 Difference]: With dead ends: 20810 [2021-11-06 00:04:33,884 INFO L226 Difference]: Without dead ends: 20806 [2021-11-06 00:04:33,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 81.22ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:04:33,892 INFO L933 BasicCegarLoop]: 26417 mSDtfsCounter, 26563 mSDsluCounter, 26259 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26563 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 40.56ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.47ms IncrementalHoareTripleChecker+Time [2021-11-06 00:04:33,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26563 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 40.56ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 20.47ms Time] [2021-11-06 00:04:33,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20806 states. [2021-11-06 00:04:34,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20806 to 20806. [2021-11-06 00:04:34,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20806 states, 20589 states have (on average 1.2892806838603137) internal successors, (26545), 20805 states have internal predecessors, (26545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20806 states to 20806 states and 26545 transitions. [2021-11-06 00:04:34,419 INFO L78 Accepts]: Start accepts. Automaton has 20806 states and 26545 transitions. Word has length 21 [2021-11-06 00:04:34,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:04:34,419 INFO L470 AbstractCegarLoop]: Abstraction has 20806 states and 26545 transitions. [2021-11-06 00:04:34,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:34,419 INFO L276 IsEmpty]: Start isEmpty. Operand 20806 states and 26545 transitions. [2021-11-06 00:04:34,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-06 00:04:34,420 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:04:34,420 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:04:34,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 00:04:34,420 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-06 00:04:34,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:04:34,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1489564549, now seen corresponding path program 1 times [2021-11-06 00:04:34,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:04:34,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620851849] [2021-11-06 00:04:34,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:04:34,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:04:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:04:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:04:34,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:04:34,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620851849] [2021-11-06 00:04:34,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620851849] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:04:34,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:04:34,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:04:34,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857741582] [2021-11-06 00:04:34,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:04:34,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:04:34,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:04:34,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:04:34,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:04:34,654 INFO L87 Difference]: Start difference. First operand 20806 states and 26545 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:35,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:04:35,176 INFO L93 Difference]: Finished difference Result 20806 states and 26545 transitions. [2021-11-06 00:04:35,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:04:35,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-06 00:04:35,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:04:35,216 INFO L225 Difference]: With dead ends: 20806 [2021-11-06 00:04:35,217 INFO L226 Difference]: Without dead ends: 20802 [2021-11-06 00:04:35,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 72.18ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:04:35,228 INFO L933 BasicCegarLoop]: 26413 mSDtfsCounter, 26549 mSDsluCounter, 26263 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26549 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 41.83ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.84ms IncrementalHoareTripleChecker+Time [2021-11-06 00:04:35,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26549 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 41.83ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 17.84ms Time] [2021-11-06 00:04:35,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20802 states. [2021-11-06 00:04:35,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20802 to 20802. [2021-11-06 00:04:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20802 states, 20587 states have (on average 1.2892116384125905) internal successors, (26541), 20801 states have internal predecessors, (26541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20802 states to 20802 states and 26541 transitions. [2021-11-06 00:04:35,829 INFO L78 Accepts]: Start accepts. Automaton has 20802 states and 26541 transitions. Word has length 23 [2021-11-06 00:04:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:04:35,830 INFO L470 AbstractCegarLoop]: Abstraction has 20802 states and 26541 transitions. [2021-11-06 00:04:35,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 20802 states and 26541 transitions. [2021-11-06 00:04:35,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-06 00:04:35,831 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:04:35,831 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:04:35,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 00:04:35,831 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-06 00:04:35,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:04:35,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1247634345, now seen corresponding path program 1 times [2021-11-06 00:04:35,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:04:35,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990395112] [2021-11-06 00:04:35,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:04:35,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:04:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:04:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:04:36,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:04:36,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990395112] [2021-11-06 00:04:36,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990395112] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:04:36,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:04:36,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:04:36,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251263628] [2021-11-06 00:04:36,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:04:36,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:04:36,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:04:36,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:04:36,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:04:36,106 INFO L87 Difference]: Start difference. First operand 20802 states and 26541 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:36,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:04:36,673 INFO L93 Difference]: Finished difference Result 20802 states and 26541 transitions. [2021-11-06 00:04:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:04:36,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-06 00:04:36,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:04:36,704 INFO L225 Difference]: With dead ends: 20802 [2021-11-06 00:04:36,704 INFO L226 Difference]: Without dead ends: 20798 [2021-11-06 00:04:36,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 83.54ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:04:36,714 INFO L933 BasicCegarLoop]: 26409 mSDtfsCounter, 26535 mSDsluCounter, 26267 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26535 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 39.48ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.71ms IncrementalHoareTripleChecker+Time [2021-11-06 00:04:36,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26535 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 39.48ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 20.71ms Time] [2021-11-06 00:04:36,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20798 states. [2021-11-06 00:04:37,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20798 to 20798. [2021-11-06 00:04:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20798 states, 20585 states have (on average 1.2891425795482148) internal successors, (26537), 20797 states have internal predecessors, (26537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20798 states to 20798 states and 26537 transitions. [2021-11-06 00:04:37,348 INFO L78 Accepts]: Start accepts. Automaton has 20798 states and 26537 transitions. Word has length 25 [2021-11-06 00:04:37,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:04:37,348 INFO L470 AbstractCegarLoop]: Abstraction has 20798 states and 26537 transitions. [2021-11-06 00:04:37,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:37,349 INFO L276 IsEmpty]: Start isEmpty. Operand 20798 states and 26537 transitions. [2021-11-06 00:04:37,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-06 00:04:37,349 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:04:37,349 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:04:37,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 00:04:37,350 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-06 00:04:37,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:04:37,350 INFO L85 PathProgramCache]: Analyzing trace with hash 680942637, now seen corresponding path program 1 times [2021-11-06 00:04:37,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:04:37,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315268666] [2021-11-06 00:04:37,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:04:37,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:04:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:04:37,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:04:37,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:04:37,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315268666] [2021-11-06 00:04:37,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315268666] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:04:37,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:04:37,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:04:37,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481012364] [2021-11-06 00:04:37,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:04:37,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:04:37,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:04:37,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:04:37,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:04:37,565 INFO L87 Difference]: Start difference. First operand 20798 states and 26537 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:38,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:04:38,071 INFO L93 Difference]: Finished difference Result 20798 states and 26537 transitions. [2021-11-06 00:04:38,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:04:38,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-06 00:04:38,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:04:38,109 INFO L225 Difference]: With dead ends: 20798 [2021-11-06 00:04:38,109 INFO L226 Difference]: Without dead ends: 20794 [2021-11-06 00:04:38,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 73.73ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:04:38,120 INFO L933 BasicCegarLoop]: 26405 mSDtfsCounter, 26521 mSDsluCounter, 26271 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26521 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 39.73ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.16ms IncrementalHoareTripleChecker+Time [2021-11-06 00:04:38,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26521 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 39.73ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 19.16ms Time] [2021-11-06 00:04:38,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20794 states. [2021-11-06 00:04:38,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20794 to 20794. [2021-11-06 00:04:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20794 states, 20583 states have (on average 1.2890735072632755) internal successors, (26533), 20793 states have internal predecessors, (26533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20794 states to 20794 states and 26533 transitions. [2021-11-06 00:04:38,785 INFO L78 Accepts]: Start accepts. Automaton has 20794 states and 26533 transitions. Word has length 27 [2021-11-06 00:04:38,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:04:38,785 INFO L470 AbstractCegarLoop]: Abstraction has 20794 states and 26533 transitions. [2021-11-06 00:04:38,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:38,785 INFO L276 IsEmpty]: Start isEmpty. Operand 20794 states and 26533 transitions. [2021-11-06 00:04:38,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-06 00:04:38,786 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:04:38,786 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:04:38,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 00:04:38,786 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-06 00:04:38,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:04:38,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1551058193, now seen corresponding path program 1 times [2021-11-06 00:04:38,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:04:38,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196670161] [2021-11-06 00:04:38,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:04:38,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:04:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:04:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:04:39,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:04:39,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196670161] [2021-11-06 00:04:39,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196670161] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:04:39,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:04:39,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:04:39,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612700089] [2021-11-06 00:04:39,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:04:39,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:04:39,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:04:39,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:04:39,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:04:39,023 INFO L87 Difference]: Start difference. First operand 20794 states and 26533 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:39,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:04:39,733 INFO L93 Difference]: Finished difference Result 20794 states and 26533 transitions. [2021-11-06 00:04:39,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:04:39,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-06 00:04:39,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:04:39,764 INFO L225 Difference]: With dead ends: 20794 [2021-11-06 00:04:39,764 INFO L226 Difference]: Without dead ends: 20790 [2021-11-06 00:04:39,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 88.32ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:04:39,773 INFO L933 BasicCegarLoop]: 26401 mSDtfsCounter, 26507 mSDsluCounter, 26275 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26507 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 45.23ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.03ms IncrementalHoareTripleChecker+Time [2021-11-06 00:04:39,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26507 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 45.23ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 23.03ms Time] [2021-11-06 00:04:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20790 states. [2021-11-06 00:04:40,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20790 to 20790. [2021-11-06 00:04:40,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20790 states, 20581 states have (on average 1.2890044215538603) internal successors, (26529), 20789 states have internal predecessors, (26529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:40,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20790 states to 20790 states and 26529 transitions. [2021-11-06 00:04:40,440 INFO L78 Accepts]: Start accepts. Automaton has 20790 states and 26529 transitions. Word has length 29 [2021-11-06 00:04:40,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:04:40,441 INFO L470 AbstractCegarLoop]: Abstraction has 20790 states and 26529 transitions. [2021-11-06 00:04:40,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:40,441 INFO L276 IsEmpty]: Start isEmpty. Operand 20790 states and 26529 transitions. [2021-11-06 00:04:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-06 00:04:40,441 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:04:40,442 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:04:40,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 00:04:40,442 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-06 00:04:40,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:04:40,442 INFO L85 PathProgramCache]: Analyzing trace with hash 213485141, now seen corresponding path program 1 times [2021-11-06 00:04:40,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:04:40,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334070948] [2021-11-06 00:04:40,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:04:40,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:04:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:04:40,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:04:40,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:04:40,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334070948] [2021-11-06 00:04:40,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334070948] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:04:40,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:04:40,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:04:40,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424710079] [2021-11-06 00:04:40,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:04:40,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:04:40,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:04:40,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:04:40,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:04:40,642 INFO L87 Difference]: Start difference. First operand 20790 states and 26529 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:04:41,196 INFO L93 Difference]: Finished difference Result 20790 states and 26529 transitions. [2021-11-06 00:04:41,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:04:41,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-06 00:04:41,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:04:41,226 INFO L225 Difference]: With dead ends: 20790 [2021-11-06 00:04:41,226 INFO L226 Difference]: Without dead ends: 20786 [2021-11-06 00:04:41,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 74.16ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:04:41,235 INFO L933 BasicCegarLoop]: 26397 mSDtfsCounter, 26493 mSDsluCounter, 26279 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26493 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 40.12ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.32ms IncrementalHoareTripleChecker+Time [2021-11-06 00:04:41,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26493 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 40.12ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 19.32ms Time] [2021-11-06 00:04:41,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20786 states. [2021-11-06 00:04:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20786 to 20786. [2021-11-06 00:04:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20786 states, 20579 states have (on average 1.2889353224160551) internal successors, (26525), 20785 states have internal predecessors, (26525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:41,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20786 states to 20786 states and 26525 transitions. [2021-11-06 00:04:41,931 INFO L78 Accepts]: Start accepts. Automaton has 20786 states and 26525 transitions. Word has length 31 [2021-11-06 00:04:41,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:04:41,931 INFO L470 AbstractCegarLoop]: Abstraction has 20786 states and 26525 transitions. [2021-11-06 00:04:41,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:41,931 INFO L276 IsEmpty]: Start isEmpty. Operand 20786 states and 26525 transitions. [2021-11-06 00:04:41,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-06 00:04:41,932 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:04:41,932 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:04:41,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 00:04:41,932 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-06 00:04:41,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:04:41,933 INFO L85 PathProgramCache]: Analyzing trace with hash -998995975, now seen corresponding path program 1 times [2021-11-06 00:04:41,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:04:41,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547505030] [2021-11-06 00:04:41,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:04:41,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:04:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:04:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:04:42,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:04:42,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547505030] [2021-11-06 00:04:42,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547505030] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:04:42,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:04:42,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:04:42,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973638507] [2021-11-06 00:04:42,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:04:42,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:04:42,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:04:42,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:04:42,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:04:42,148 INFO L87 Difference]: Start difference. First operand 20786 states and 26525 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:04:42,794 INFO L93 Difference]: Finished difference Result 20786 states and 26525 transitions. [2021-11-06 00:04:42,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:04:42,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-06 00:04:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:04:42,825 INFO L225 Difference]: With dead ends: 20786 [2021-11-06 00:04:42,826 INFO L226 Difference]: Without dead ends: 20782 [2021-11-06 00:04:42,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 78.37ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:04:42,834 INFO L933 BasicCegarLoop]: 26393 mSDtfsCounter, 26479 mSDsluCounter, 26283 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26479 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 39.34ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.77ms IncrementalHoareTripleChecker+Time [2021-11-06 00:04:42,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26479 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 39.34ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 19.77ms Time] [2021-11-06 00:04:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20782 states. [2021-11-06 00:04:43,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20782 to 20782. [2021-11-06 00:04:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20782 states, 20577 states have (on average 1.2888662098459445) internal successors, (26521), 20781 states have internal predecessors, (26521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20782 states to 20782 states and 26521 transitions. [2021-11-06 00:04:43,439 INFO L78 Accepts]: Start accepts. Automaton has 20782 states and 26521 transitions. Word has length 33 [2021-11-06 00:04:43,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:04:43,439 INFO L470 AbstractCegarLoop]: Abstraction has 20782 states and 26521 transitions. [2021-11-06 00:04:43,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:43,439 INFO L276 IsEmpty]: Start isEmpty. Operand 20782 states and 26521 transitions. [2021-11-06 00:04:43,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-06 00:04:43,440 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:04:43,440 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:04:43,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 00:04:43,441 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-06 00:04:43,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:04:43,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2037756413, now seen corresponding path program 1 times [2021-11-06 00:04:43,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:04:43,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017159785] [2021-11-06 00:04:43,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:04:43,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:04:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:04:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:04:43,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:04:43,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017159785] [2021-11-06 00:04:43,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017159785] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:04:43,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:04:43,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:04:43,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787137071] [2021-11-06 00:04:43,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:04:43,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:04:43,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:04:43,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:04:43,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:04:43,692 INFO L87 Difference]: Start difference. First operand 20782 states and 26521 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:44,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:04:44,378 INFO L93 Difference]: Finished difference Result 20782 states and 26521 transitions. [2021-11-06 00:04:44,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:04:44,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-06 00:04:44,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:04:44,416 INFO L225 Difference]: With dead ends: 20782 [2021-11-06 00:04:44,416 INFO L226 Difference]: Without dead ends: 20778 [2021-11-06 00:04:44,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 89.64ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:04:44,426 INFO L933 BasicCegarLoop]: 26389 mSDtfsCounter, 26465 mSDsluCounter, 26287 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26465 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 39.91ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.83ms IncrementalHoareTripleChecker+Time [2021-11-06 00:04:44,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26465 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 39.91ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 21.83ms Time] [2021-11-06 00:04:44,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20778 states. [2021-11-06 00:04:45,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20778 to 20778. [2021-11-06 00:04:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20778 states, 20575 states have (on average 1.2887970838396112) internal successors, (26517), 20777 states have internal predecessors, (26517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20778 states to 20778 states and 26517 transitions. [2021-11-06 00:04:45,242 INFO L78 Accepts]: Start accepts. Automaton has 20778 states and 26517 transitions. Word has length 35 [2021-11-06 00:04:45,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:04:45,243 INFO L470 AbstractCegarLoop]: Abstraction has 20778 states and 26517 transitions. [2021-11-06 00:04:45,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:45,243 INFO L276 IsEmpty]: Start isEmpty. Operand 20778 states and 26517 transitions. [2021-11-06 00:04:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-06 00:04:45,244 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:04:45,244 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:04:45,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 00:04:45,244 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-06 00:04:45,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:04:45,245 INFO L85 PathProgramCache]: Analyzing trace with hash -220960640, now seen corresponding path program 1 times [2021-11-06 00:04:45,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:04:45,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304089456] [2021-11-06 00:04:45,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:04:45,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:04:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:04:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:04:45,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:04:45,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304089456] [2021-11-06 00:04:45,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304089456] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:04:45,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:04:45,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:04:45,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755196075] [2021-11-06 00:04:45,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:04:45,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:04:45,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:04:45,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:04:45,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:04:45,475 INFO L87 Difference]: Start difference. First operand 20778 states and 26517 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:46,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:04:46,144 INFO L93 Difference]: Finished difference Result 20778 states and 26517 transitions. [2021-11-06 00:04:46,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:04:46,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-06 00:04:46,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:04:46,175 INFO L225 Difference]: With dead ends: 20778 [2021-11-06 00:04:46,175 INFO L226 Difference]: Without dead ends: 20774 [2021-11-06 00:04:46,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 68.20ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:04:46,184 INFO L933 BasicCegarLoop]: 26385 mSDtfsCounter, 26451 mSDsluCounter, 26291 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26451 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 42.52ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.31ms IncrementalHoareTripleChecker+Time [2021-11-06 00:04:46,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26451 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 42.52ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 20.31ms Time] [2021-11-06 00:04:46,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20774 states. [2021-11-06 00:04:46,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20774 to 20774. [2021-11-06 00:04:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20774 states, 20573 states have (on average 1.2887279443931365) internal successors, (26513), 20773 states have internal predecessors, (26513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20774 states to 20774 states and 26513 transitions. [2021-11-06 00:04:46,941 INFO L78 Accepts]: Start accepts. Automaton has 20774 states and 26513 transitions. Word has length 37 [2021-11-06 00:04:46,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:04:46,942 INFO L470 AbstractCegarLoop]: Abstraction has 20774 states and 26513 transitions. [2021-11-06 00:04:46,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:46,942 INFO L276 IsEmpty]: Start isEmpty. Operand 20774 states and 26513 transitions. [2021-11-06 00:04:46,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-06 00:04:46,943 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:04:46,943 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:04:46,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 00:04:46,943 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-06 00:04:46,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:04:46,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1889562780, now seen corresponding path program 1 times [2021-11-06 00:04:46,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:04:46,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104774492] [2021-11-06 00:04:46,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:04:46,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:04:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:04:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:04:47,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:04:47,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104774492] [2021-11-06 00:04:47,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104774492] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:04:47,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:04:47,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:04:47,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133837491] [2021-11-06 00:04:47,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:04:47,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:04:47,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:04:47,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:04:47,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:04:47,155 INFO L87 Difference]: Start difference. First operand 20774 states and 26513 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:47,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:04:47,870 INFO L93 Difference]: Finished difference Result 20774 states and 26513 transitions. [2021-11-06 00:04:47,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:04:47,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-06 00:04:47,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:04:47,905 INFO L225 Difference]: With dead ends: 20774 [2021-11-06 00:04:47,905 INFO L226 Difference]: Without dead ends: 20770 [2021-11-06 00:04:47,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 75.02ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:04:47,914 INFO L933 BasicCegarLoop]: 26381 mSDtfsCounter, 26437 mSDsluCounter, 26295 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26437 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 42.13ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.48ms IncrementalHoareTripleChecker+Time [2021-11-06 00:04:47,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26437 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 42.13ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 17.48ms Time] [2021-11-06 00:04:47,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20770 states. [2021-11-06 00:04:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20770 to 20770. [2021-11-06 00:04:48,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20770 states, 20571 states have (on average 1.2886587915026007) internal successors, (26509), 20769 states have internal predecessors, (26509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20770 states to 20770 states and 26509 transitions. [2021-11-06 00:04:48,621 INFO L78 Accepts]: Start accepts. Automaton has 20770 states and 26509 transitions. Word has length 39 [2021-11-06 00:04:48,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:04:48,622 INFO L470 AbstractCegarLoop]: Abstraction has 20770 states and 26509 transitions. [2021-11-06 00:04:48,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:48,622 INFO L276 IsEmpty]: Start isEmpty. Operand 20770 states and 26509 transitions. [2021-11-06 00:04:48,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 00:04:48,623 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:04:48,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:04:48,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 00:04:48,623 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-06 00:04:48,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:04:48,624 INFO L85 PathProgramCache]: Analyzing trace with hash 901549736, now seen corresponding path program 1 times [2021-11-06 00:04:48,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:04:48,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750529843] [2021-11-06 00:04:48,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:04:48,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:04:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:04:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:04:48,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:04:48,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750529843] [2021-11-06 00:04:48,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750529843] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:04:48,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:04:48,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:04:48,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362001111] [2021-11-06 00:04:48,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:04:48,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:04:48,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:04:48,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:04:48,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:04:48,824 INFO L87 Difference]: Start difference. First operand 20770 states and 26509 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:49,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:04:49,567 INFO L93 Difference]: Finished difference Result 20770 states and 26509 transitions. [2021-11-06 00:04:49,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:04:49,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-06 00:04:49,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:04:49,604 INFO L225 Difference]: With dead ends: 20770 [2021-11-06 00:04:49,604 INFO L226 Difference]: Without dead ends: 20766 [2021-11-06 00:04:49,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 70.28ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:04:49,615 INFO L933 BasicCegarLoop]: 26377 mSDtfsCounter, 26423 mSDsluCounter, 26299 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26423 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 41.50ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.79ms IncrementalHoareTripleChecker+Time [2021-11-06 00:04:49,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26423 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 41.50ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 18.79ms Time] [2021-11-06 00:04:49,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20766 states. [2021-11-06 00:04:50,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20766 to 20766. [2021-11-06 00:04:50,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20766 states, 20569 states have (on average 1.2885896251640818) internal successors, (26505), 20765 states have internal predecessors, (26505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20766 states to 20766 states and 26505 transitions. [2021-11-06 00:04:50,465 INFO L78 Accepts]: Start accepts. Automaton has 20766 states and 26505 transitions. Word has length 41 [2021-11-06 00:04:50,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:04:50,465 INFO L470 AbstractCegarLoop]: Abstraction has 20766 states and 26505 transitions. [2021-11-06 00:04:50,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 20766 states and 26505 transitions. [2021-11-06 00:04:50,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-06 00:04:50,467 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:04:50,467 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:04:50,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 00:04:50,467 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-06 00:04:50,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:04:50,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1768886377, now seen corresponding path program 1 times [2021-11-06 00:04:50,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:04:50,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360822959] [2021-11-06 00:04:50,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:04:50,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:04:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:04:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:04:50,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:04:50,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360822959] [2021-11-06 00:04:50,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360822959] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:04:50,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:04:50,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:04:50,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399484622] [2021-11-06 00:04:50,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:04:50,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:04:50,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:04:50,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:04:50,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:04:50,708 INFO L87 Difference]: Start difference. First operand 20766 states and 26505 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:53,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:04:53,680 INFO L93 Difference]: Finished difference Result 43349 states and 55072 transitions. [2021-11-06 00:04:53,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 00:04:53,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-06 00:04:53,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:04:53,746 INFO L225 Difference]: With dead ends: 43349 [2021-11-06 00:04:53,746 INFO L226 Difference]: Without dead ends: 43325 [2021-11-06 00:04:53,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 72.05ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:04:53,761 INFO L933 BasicCegarLoop]: 29897 mSDtfsCounter, 76700 mSDsluCounter, 28838 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1237.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 76700 SdHoareTripleChecker+Valid, 58735 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 80.62ms SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1347.79ms IncrementalHoareTripleChecker+Time [2021-11-06 00:04:53,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76700 Valid, 58735 Invalid, 377 Unknown, 0 Unchecked, 80.62ms Time], IncrementalHoareTripleChecker [132 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 1347.79ms Time] [2021-11-06 00:04:53,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43325 states. [2021-11-06 00:04:55,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43325 to 40110. [2021-11-06 00:04:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40110 states, 39918 states have (on average 1.2909965429129715) internal successors, (51534), 40109 states have internal predecessors, (51534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40110 states to 40110 states and 51534 transitions. [2021-11-06 00:04:55,336 INFO L78 Accepts]: Start accepts. Automaton has 40110 states and 51534 transitions. Word has length 43 [2021-11-06 00:04:55,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:04:55,336 INFO L470 AbstractCegarLoop]: Abstraction has 40110 states and 51534 transitions. [2021-11-06 00:04:55,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:04:55,337 INFO L276 IsEmpty]: Start isEmpty. Operand 40110 states and 51534 transitions. [2021-11-06 00:04:55,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-06 00:04:55,337 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:04:55,337 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:04:55,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 00:04:55,338 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-06 00:04:55,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:04:55,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1193882036, now seen corresponding path program 1 times [2021-11-06 00:04:55,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:04:55,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936529033] [2021-11-06 00:04:55,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:04:55,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:04:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:04:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:04:55,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:04:55,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936529033] [2021-11-06 00:04:55,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936529033] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:04:55,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:04:55,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:04:55,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111761223] [2021-11-06 00:04:55,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:04:55,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:04:55,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:04:55,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:04:55,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:04:55,534 INFO L87 Difference]: Start difference. First operand 40110 states and 51534 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)