./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.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 68ead1e29a6cc769e9e712c81a52de8a551f5275fff71a8b8c48675aa28de434 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 21:36:07,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 21:36:07,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 21:36:07,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 21:36:07,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 21:36:07,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 21:36:07,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 21:36:07,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 21:36:07,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 21:36:07,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 21:36:07,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 21:36:07,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 21:36:07,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 21:36:07,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 21:36:07,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 21:36:07,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 21:36:07,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 21:36:07,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 21:36:07,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 21:36:07,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 21:36:07,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 21:36:07,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 21:36:07,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 21:36:07,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 21:36:07,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 21:36:07,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 21:36:07,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 21:36:07,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 21:36:07,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 21:36:07,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 21:36:07,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 21:36:07,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 21:36:07,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 21:36:07,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 21:36:07,358 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 21:36:07,358 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 21:36:07,359 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 21:36:07,359 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 21:36:07,359 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 21:36:07,360 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 21:36:07,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 21:36:07,361 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 21:36:07,378 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 21:36:07,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 21:36:07,381 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 21:36:07,381 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 21:36:07,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 21:36:07,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 21:36:07,382 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 21:36:07,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 21:36:07,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 21:36:07,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 21:36:07,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 21:36:07,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 21:36:07,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 21:36:07,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 21:36:07,384 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 21:36:07,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 21:36:07,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 21:36:07,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 21:36:07,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 21:36:07,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:36:07,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 21:36:07,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 21:36:07,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 21:36:07,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 21:36:07,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 21:36:07,386 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 21:36:07,386 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 21:36:07,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 21:36:07,386 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 21:36:07,386 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 -> 68ead1e29a6cc769e9e712c81a52de8a551f5275fff71a8b8c48675aa28de434 [2021-11-06 21:36:07,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 21:36:07,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 21:36:07,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 21:36:07,592 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 21:36:07,593 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 21:36:07,593 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i [2021-11-06 21:36:07,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e1d4a302/c65a94000bee49d988a0a1cff596e812/FLAGeae873a81 [2021-11-06 21:36:08,343 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 21:36:08,344 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i [2021-11-06 21:36:08,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e1d4a302/c65a94000bee49d988a0a1cff596e812/FLAGeae873a81 [2021-11-06 21:36:08,663 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e1d4a302/c65a94000bee49d988a0a1cff596e812 [2021-11-06 21:36:08,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 21:36:08,666 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 21:36:08,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 21:36:08,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 21:36:08,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 21:36:08,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:36:08" (1/1) ... [2021-11-06 21:36:08,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@288fc44f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:36:08, skipping insertion in model container [2021-11-06 21:36:08,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:36:08" (1/1) ... [2021-11-06 21:36:08,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 21:36:08,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 21:36:11,495 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[418415,418428] [2021-11-06 21:36:11,497 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[418560,418573] [2021-11-06 21:36:11,498 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[418706,418719] [2021-11-06 21:36:11,498 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[418871,418884] [2021-11-06 21:36:11,498 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419029,419042] [2021-11-06 21:36:11,499 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419187,419200] [2021-11-06 21:36:11,499 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419345,419358] [2021-11-06 21:36:11,499 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419505,419518] [2021-11-06 21:36:11,500 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419664,419677] [2021-11-06 21:36:11,500 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419803,419816] [2021-11-06 21:36:11,500 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419945,419958] [2021-11-06 21:36:11,501 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420094,420107] [2021-11-06 21:36:11,501 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420233,420246] [2021-11-06 21:36:11,501 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420388,420401] [2021-11-06 21:36:11,502 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420548,420561] [2021-11-06 21:36:11,502 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420699,420712] [2021-11-06 21:36:11,502 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420850,420863] [2021-11-06 21:36:11,502 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421002,421015] [2021-11-06 21:36:11,503 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421151,421164] [2021-11-06 21:36:11,503 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421299,421312] [2021-11-06 21:36:11,503 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421456,421469] [2021-11-06 21:36:11,504 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421605,421618] [2021-11-06 21:36:11,504 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421761,421774] [2021-11-06 21:36:11,504 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421914,421927] [2021-11-06 21:36:11,505 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422060,422073] [2021-11-06 21:36:11,505 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422203,422216] [2021-11-06 21:36:11,505 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422355,422368] [2021-11-06 21:36:11,505 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422501,422514] [2021-11-06 21:36:11,506 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422646,422659] [2021-11-06 21:36:11,506 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422800,422813] [2021-11-06 21:36:11,506 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422951,422964] [2021-11-06 21:36:11,507 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423106,423119] [2021-11-06 21:36:11,507 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423258,423271] [2021-11-06 21:36:11,507 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423413,423426] [2021-11-06 21:36:11,507 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423577,423590] [2021-11-06 21:36:11,508 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423733,423746] [2021-11-06 21:36:11,508 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423897,423910] [2021-11-06 21:36:11,508 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424039,424052] [2021-11-06 21:36:11,509 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424197,424210] [2021-11-06 21:36:11,509 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424364,424377] [2021-11-06 21:36:11,509 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424523,424536] [2021-11-06 21:36:11,509 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424682,424695] [2021-11-06 21:36:11,510 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424831,424844] [2021-11-06 21:36:11,510 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424978,424991] [2021-11-06 21:36:11,510 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425117,425130] [2021-11-06 21:36:11,511 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425280,425293] [2021-11-06 21:36:11,511 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425446,425459] [2021-11-06 21:36:11,511 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425610,425623] [2021-11-06 21:36:11,511 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425775,425788] [2021-11-06 21:36:11,512 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425940,425953] [2021-11-06 21:36:11,512 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426106,426119] [2021-11-06 21:36:11,512 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426271,426284] [2021-11-06 21:36:11,513 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426438,426451] [2021-11-06 21:36:11,513 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426598,426611] [2021-11-06 21:36:11,513 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426760,426773] [2021-11-06 21:36:11,513 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426919,426932] [2021-11-06 21:36:11,514 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427065,427078] [2021-11-06 21:36:11,514 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427208,427221] [2021-11-06 21:36:11,514 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427352,427365] [2021-11-06 21:36:11,515 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427495,427508] [2021-11-06 21:36:11,515 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427639,427652] [2021-11-06 21:36:11,515 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427780,427793] [2021-11-06 21:36:11,515 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427918,427931] [2021-11-06 21:36:11,516 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428076,428089] [2021-11-06 21:36:11,516 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428235,428248] [2021-11-06 21:36:11,516 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428391,428404] [2021-11-06 21:36:11,517 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428540,428553] [2021-11-06 21:36:11,517 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428692,428705] [2021-11-06 21:36:11,517 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428843,428856] [2021-11-06 21:36:11,517 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428992,429005] [2021-11-06 21:36:11,518 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429144,429157] [2021-11-06 21:36:11,518 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429292,429305] [2021-11-06 21:36:11,518 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429445,429458] [2021-11-06 21:36:11,519 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429596,429609] [2021-11-06 21:36:11,519 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429746,429759] [2021-11-06 21:36:11,519 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429893,429906] [2021-11-06 21:36:11,519 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430044,430057] [2021-11-06 21:36:11,520 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430195,430208] [2021-11-06 21:36:11,520 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430343,430356] [2021-11-06 21:36:11,520 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430509,430522] [2021-11-06 21:36:11,521 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430678,430691] [2021-11-06 21:36:11,521 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430845,430858] [2021-11-06 21:36:11,521 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431013,431026] [2021-11-06 21:36:11,521 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431163,431176] [2021-11-06 21:36:11,522 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431310,431323] [2021-11-06 21:36:11,522 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431471,431484] [2021-11-06 21:36:11,522 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431641,431654] [2021-11-06 21:36:11,522 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431803,431816] [2021-11-06 21:36:11,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:36:11,565 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 21:36:11,950 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[418415,418428] [2021-11-06 21:36:11,951 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[418560,418573] [2021-11-06 21:36:11,951 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[418706,418719] [2021-11-06 21:36:11,952 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[418871,418884] [2021-11-06 21:36:11,952 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419029,419042] [2021-11-06 21:36:11,953 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419187,419200] [2021-11-06 21:36:11,954 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419345,419358] [2021-11-06 21:36:11,954 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419505,419518] [2021-11-06 21:36:11,954 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419664,419677] [2021-11-06 21:36:11,955 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419803,419816] [2021-11-06 21:36:11,955 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419945,419958] [2021-11-06 21:36:11,956 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420094,420107] [2021-11-06 21:36:11,956 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420233,420246] [2021-11-06 21:36:11,956 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420388,420401] [2021-11-06 21:36:11,957 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420548,420561] [2021-11-06 21:36:11,957 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420699,420712] [2021-11-06 21:36:11,957 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420850,420863] [2021-11-06 21:36:11,957 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421002,421015] [2021-11-06 21:36:11,958 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421151,421164] [2021-11-06 21:36:11,958 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421299,421312] [2021-11-06 21:36:11,958 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421456,421469] [2021-11-06 21:36:11,959 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421605,421618] [2021-11-06 21:36:11,960 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421761,421774] [2021-11-06 21:36:11,960 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421914,421927] [2021-11-06 21:36:11,960 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422060,422073] [2021-11-06 21:36:11,961 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422203,422216] [2021-11-06 21:36:11,961 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422355,422368] [2021-11-06 21:36:11,961 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422501,422514] [2021-11-06 21:36:11,961 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422646,422659] [2021-11-06 21:36:11,962 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422800,422813] [2021-11-06 21:36:11,962 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422951,422964] [2021-11-06 21:36:11,962 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423106,423119] [2021-11-06 21:36:11,963 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423258,423271] [2021-11-06 21:36:11,963 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423413,423426] [2021-11-06 21:36:11,963 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423577,423590] [2021-11-06 21:36:11,964 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423733,423746] [2021-11-06 21:36:11,964 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423897,423910] [2021-11-06 21:36:11,964 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424039,424052] [2021-11-06 21:36:11,965 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424197,424210] [2021-11-06 21:36:11,965 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424364,424377] [2021-11-06 21:36:11,966 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424523,424536] [2021-11-06 21:36:11,967 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424682,424695] [2021-11-06 21:36:11,967 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424831,424844] [2021-11-06 21:36:11,968 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424978,424991] [2021-11-06 21:36:11,968 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425117,425130] [2021-11-06 21:36:11,968 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425280,425293] [2021-11-06 21:36:11,968 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425446,425459] [2021-11-06 21:36:11,969 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425610,425623] [2021-11-06 21:36:11,969 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425775,425788] [2021-11-06 21:36:11,969 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425940,425953] [2021-11-06 21:36:11,970 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426106,426119] [2021-11-06 21:36:11,970 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426271,426284] [2021-11-06 21:36:11,970 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426438,426451] [2021-11-06 21:36:11,971 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426598,426611] [2021-11-06 21:36:11,971 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426760,426773] [2021-11-06 21:36:11,971 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426919,426932] [2021-11-06 21:36:11,972 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427065,427078] [2021-11-06 21:36:11,975 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427208,427221] [2021-11-06 21:36:11,976 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427352,427365] [2021-11-06 21:36:11,976 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427495,427508] [2021-11-06 21:36:11,976 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427639,427652] [2021-11-06 21:36:11,977 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427780,427793] [2021-11-06 21:36:11,977 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427918,427931] [2021-11-06 21:36:11,978 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428076,428089] [2021-11-06 21:36:11,979 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428235,428248] [2021-11-06 21:36:11,981 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428391,428404] [2021-11-06 21:36:11,981 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428540,428553] [2021-11-06 21:36:11,981 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428692,428705] [2021-11-06 21:36:11,982 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428843,428856] [2021-11-06 21:36:11,982 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428992,429005] [2021-11-06 21:36:11,982 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429144,429157] [2021-11-06 21:36:11,983 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429292,429305] [2021-11-06 21:36:11,983 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429445,429458] [2021-11-06 21:36:11,983 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429596,429609] [2021-11-06 21:36:11,987 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429746,429759] [2021-11-06 21:36:11,987 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429893,429906] [2021-11-06 21:36:11,988 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430044,430057] [2021-11-06 21:36:11,988 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430195,430208] [2021-11-06 21:36:11,989 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430343,430356] [2021-11-06 21:36:11,989 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430509,430522] [2021-11-06 21:36:11,990 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430678,430691] [2021-11-06 21:36:11,990 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430845,430858] [2021-11-06 21:36:11,990 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431013,431026] [2021-11-06 21:36:11,991 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431163,431176] [2021-11-06 21:36:11,991 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431310,431323] [2021-11-06 21:36:11,991 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431471,431484] [2021-11-06 21:36:11,991 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431641,431654] [2021-11-06 21:36:11,992 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431803,431816] [2021-11-06 21:36:11,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:36:12,163 INFO L208 MainTranslator]: Completed translation [2021-11-06 21:36:12,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:36:12 WrapperNode [2021-11-06 21:36:12,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 21:36:12,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 21:36:12,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 21:36:12,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 21:36:12,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:36:12" (1/1) ... [2021-11-06 21:36:12,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:36:12" (1/1) ... [2021-11-06 21:36:12,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 21:36:12,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 21:36:12,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 21:36:12,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 21:36:12,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:36:12" (1/1) ... [2021-11-06 21:36:12,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:36:12" (1/1) ... [2021-11-06 21:36:12,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:36:12" (1/1) ... [2021-11-06 21:36:12,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:36:12" (1/1) ... [2021-11-06 21:36:13,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:36:12" (1/1) ... [2021-11-06 21:36:13,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:36:12" (1/1) ... [2021-11-06 21:36:13,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:36:12" (1/1) ... [2021-11-06 21:36:13,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 21:36:13,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 21:36:13,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 21:36:13,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 21:36:13,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:36:12" (1/1) ... [2021-11-06 21:36:13,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:36:13,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:36:13,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 21:36:13,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 21:36:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_streamon [2021-11-06 21:36:13,466 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_streamon [2021-11-06 21:36:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure int_irq [2021-11-06 21:36:13,467 INFO L138 BoogieDeclarations]: Found implementation of procedure int_irq [2021-11-06 21:36:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 21:36:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_stream_off [2021-11-06 21:36:13,467 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_stream_off [2021-11-06 21:36:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 21:36:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 21:36:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 21:36:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure dev_close [2021-11-06 21:36:13,467 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_close [2021-11-06 21:36:13,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 21:36:13,468 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_resume [2021-11-06 21:36:13,468 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_resume [2021-11-06 21:36:13,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 21:36:13,468 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-06 21:36:13,468 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-06 21:36:13,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-06 21:36:13,468 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2021-11-06 21:36:13,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2021-11-06 21:36:13,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 21:36:13,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 21:36:13,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 21:36:13,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 21:36:13,469 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_streamoff [2021-11-06 21:36:13,469 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_streamoff [2021-11-06 21:36:13,469 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_init_transfer [2021-11-06 21:36:13,470 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_init_transfer [2021-11-06 21:36:13,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 21:36:13,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 21:36:13,470 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2021-11-06 21:36:13,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2021-11-06 21:36:13,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 21:36:13,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 21:36:13,470 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_disconnect [2021-11-06 21:36:13,470 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_disconnect [2021-11-06 21:36:13,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 21:36:27,491 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_2_returnLabel: main_#res := 0; [2021-11-06 21:36:27,491 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L9685: #t~ret2076 := main_#res; [2021-11-06 21:36:27,492 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-06 21:36:28,268 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 21:36:28,269 INFO L299 CfgBuilder]: Removed 4013 assume(true) statements. [2021-11-06 21:36:28,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:36:28 BoogieIcfgContainer [2021-11-06 21:36:28,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 21:36:28,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 21:36:28,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 21:36:28,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 21:36:28,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:36:08" (1/3) ... [2021-11-06 21:36:28,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@100376bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:36:28, skipping insertion in model container [2021-11-06 21:36:28,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:36:12" (2/3) ... [2021-11-06 21:36:28,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@100376bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:36:28, skipping insertion in model container [2021-11-06 21:36:28,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:36:28" (3/3) ... [2021-11-06 21:36:28,281 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i [2021-11-06 21:36:28,285 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 21:36:28,286 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 232 error locations. [2021-11-06 21:36:28,338 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 21:36:28,351 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 21:36:28,351 INFO L340 AbstractCegarLoop]: Starting to check reachability of 232 error locations. [2021-11-06 21:36:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 4841 states, 4548 states have (on average 1.4263412489006158) internal successors, (6487), 4782 states have internal predecessors, (6487), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-06 21:36:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-06 21:36:28,559 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:28,559 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:28,560 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1480938258, now seen corresponding path program 1 times [2021-11-06 21:36:28,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:28,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086721561] [2021-11-06 21:36:28,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:28,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:29,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:29,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086721561] [2021-11-06 21:36:29,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086721561] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:29,056 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:29,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:29,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356493615] [2021-11-06 21:36:29,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:29,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:29,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:29,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:29,079 INFO L87 Difference]: Start difference. First operand has 4841 states, 4548 states have (on average 1.4263412489006158) internal successors, (6487), 4782 states have internal predecessors, (6487), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:29,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:29,334 INFO L93 Difference]: Finished difference Result 9497 states and 12994 transitions. [2021-11-06 21:36:29,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:29,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-06 21:36:29,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:29,361 INFO L225 Difference]: With dead ends: 9497 [2021-11-06 21:36:29,361 INFO L226 Difference]: Without dead ends: 4593 [2021-11-06 21:36:29,387 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2021-11-06 21:36:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 4593. [2021-11-06 21:36:29,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4593 states, 4302 states have (on average 1.3375174337517435) internal successors, (5754), 4534 states have internal predecessors, (5754), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-06 21:36:29,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4593 states to 4593 states and 5854 transitions. [2021-11-06 21:36:29,563 INFO L78 Accepts]: Start accepts. Automaton has 4593 states and 5854 transitions. Word has length 19 [2021-11-06 21:36:29,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:29,564 INFO L470 AbstractCegarLoop]: Abstraction has 4593 states and 5854 transitions. [2021-11-06 21:36:29,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 5854 transitions. [2021-11-06 21:36:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-06 21:36:29,565 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:29,566 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:29,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 21:36:29,566 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:29,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:29,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1547302030, now seen corresponding path program 1 times [2021-11-06 21:36:29,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:29,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134793809] [2021-11-06 21:36:29,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:29,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:29,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:29,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134793809] [2021-11-06 21:36:29,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134793809] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:29,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:29,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:29,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980929335] [2021-11-06 21:36:29,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:29,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:29,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:29,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:29,746 INFO L87 Difference]: Start difference. First operand 4593 states and 5854 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 21:36:29,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:29,863 INFO L93 Difference]: Finished difference Result 4593 states and 5854 transitions. [2021-11-06 21:36:29,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:29,864 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 21:36:29,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:29,879 INFO L225 Difference]: With dead ends: 4593 [2021-11-06 21:36:29,879 INFO L226 Difference]: Without dead ends: 4589 [2021-11-06 21:36:29,882 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:29,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4589 states. [2021-11-06 21:36:29,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4589 to 4589. [2021-11-06 21:36:29,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4589 states, 4300 states have (on average 1.3372093023255813) internal successors, (5750), 4530 states have internal predecessors, (5750), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-06 21:36:30,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4589 states to 4589 states and 5850 transitions. [2021-11-06 21:36:30,015 INFO L78 Accepts]: Start accepts. Automaton has 4589 states and 5850 transitions. Word has length 21 [2021-11-06 21:36:30,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:30,016 INFO L470 AbstractCegarLoop]: Abstraction has 4589 states and 5850 transitions. [2021-11-06 21:36:30,016 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 21:36:30,016 INFO L276 IsEmpty]: Start isEmpty. Operand 4589 states and 5850 transitions. [2021-11-06 21:36:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-06 21:36:30,017 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:30,017 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:30,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 21:36:30,018 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:30,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:30,019 INFO L85 PathProgramCache]: Analyzing trace with hash -898377130, now seen corresponding path program 1 times [2021-11-06 21:36:30,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:30,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17067956] [2021-11-06 21:36:30,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:30,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:30,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:30,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17067956] [2021-11-06 21:36:30,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17067956] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:30,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:30,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:30,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939257312] [2021-11-06 21:36:30,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:30,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:30,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:30,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:30,209 INFO L87 Difference]: Start difference. First operand 4589 states and 5850 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 21:36:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:30,322 INFO L93 Difference]: Finished difference Result 4589 states and 5850 transitions. [2021-11-06 21:36:30,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:30,323 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 21:36:30,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:30,336 INFO L225 Difference]: With dead ends: 4589 [2021-11-06 21:36:30,336 INFO L226 Difference]: Without dead ends: 4585 [2021-11-06 21:36:30,338 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:30,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4585 states. [2021-11-06 21:36:30,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4585 to 4585. [2021-11-06 21:36:30,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4585 states, 4298 states have (on average 1.3369008841321546) internal successors, (5746), 4526 states have internal predecessors, (5746), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-06 21:36:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4585 states to 4585 states and 5846 transitions. [2021-11-06 21:36:30,455 INFO L78 Accepts]: Start accepts. Automaton has 4585 states and 5846 transitions. Word has length 23 [2021-11-06 21:36:30,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:30,455 INFO L470 AbstractCegarLoop]: Abstraction has 4585 states and 5846 transitions. [2021-11-06 21:36:30,456 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 21:36:30,456 INFO L276 IsEmpty]: Start isEmpty. Operand 4585 states and 5846 transitions. [2021-11-06 21:36:30,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-06 21:36:30,457 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:30,457 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:30,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 21:36:30,457 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:30,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:30,458 INFO L85 PathProgramCache]: Analyzing trace with hash -51805798, now seen corresponding path program 1 times [2021-11-06 21:36:30,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:30,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124784961] [2021-11-06 21:36:30,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:30,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:30,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:30,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:30,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124784961] [2021-11-06 21:36:30,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124784961] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:30,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:30,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:30,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357744012] [2021-11-06 21:36:30,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:30,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:30,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:30,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:30,605 INFO L87 Difference]: Start difference. First operand 4585 states and 5846 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:30,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:30,796 INFO L93 Difference]: Finished difference Result 4585 states and 5846 transitions. [2021-11-06 21:36:30,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:30,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-06 21:36:30,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:30,818 INFO L225 Difference]: With dead ends: 4585 [2021-11-06 21:36:30,818 INFO L226 Difference]: Without dead ends: 4581 [2021-11-06 21:36:30,819 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4581 states. [2021-11-06 21:36:30,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4581 to 4581. [2021-11-06 21:36:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4581 states, 4296 states have (on average 1.3365921787709498) internal successors, (5742), 4522 states have internal predecessors, (5742), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-06 21:36:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4581 states to 4581 states and 5842 transitions. [2021-11-06 21:36:30,918 INFO L78 Accepts]: Start accepts. Automaton has 4581 states and 5842 transitions. Word has length 25 [2021-11-06 21:36:30,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:30,919 INFO L470 AbstractCegarLoop]: Abstraction has 4581 states and 5842 transitions. [2021-11-06 21:36:30,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 4581 states and 5842 transitions. [2021-11-06 21:36:30,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-06 21:36:30,919 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:30,920 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:30,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 21:36:30,920 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:30,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:30,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1754425662, now seen corresponding path program 1 times [2021-11-06 21:36:30,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:30,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868646908] [2021-11-06 21:36:30,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:30,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:31,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:31,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868646908] [2021-11-06 21:36:31,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868646908] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:31,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:31,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:31,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293136350] [2021-11-06 21:36:31,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:31,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:31,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:31,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:31,079 INFO L87 Difference]: Start difference. First operand 4581 states and 5842 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 21:36:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:31,176 INFO L93 Difference]: Finished difference Result 4581 states and 5842 transitions. [2021-11-06 21:36:31,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:31,186 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 21:36:31,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:31,201 INFO L225 Difference]: With dead ends: 4581 [2021-11-06 21:36:31,201 INFO L226 Difference]: Without dead ends: 4577 [2021-11-06 21:36:31,204 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:31,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4577 states. [2021-11-06 21:36:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4577 to 4577. [2021-11-06 21:36:31,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 4294 states have (on average 1.336283185840708) internal successors, (5738), 4518 states have internal predecessors, (5738), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-06 21:36:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 5838 transitions. [2021-11-06 21:36:31,313 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 5838 transitions. Word has length 27 [2021-11-06 21:36:31,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:31,314 INFO L470 AbstractCegarLoop]: Abstraction has 4577 states and 5838 transitions. [2021-11-06 21:36:31,314 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 21:36:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 5838 transitions. [2021-11-06 21:36:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-06 21:36:31,315 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:31,315 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:31,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 21:36:31,316 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:31,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:31,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1918895806, now seen corresponding path program 1 times [2021-11-06 21:36:31,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:31,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608377042] [2021-11-06 21:36:31,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:31,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:31,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:31,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:31,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608377042] [2021-11-06 21:36:31,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608377042] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:31,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:31,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:31,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170679855] [2021-11-06 21:36:31,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:31,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:31,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:31,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:31,480 INFO L87 Difference]: Start difference. First operand 4577 states and 5838 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 21:36:31,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:31,577 INFO L93 Difference]: Finished difference Result 4577 states and 5838 transitions. [2021-11-06 21:36:31,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:31,577 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 21:36:31,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:31,601 INFO L225 Difference]: With dead ends: 4577 [2021-11-06 21:36:31,601 INFO L226 Difference]: Without dead ends: 4573 [2021-11-06 21:36:31,603 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:31,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2021-11-06 21:36:31,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 4573. [2021-11-06 21:36:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4573 states, 4292 states have (on average 1.3359739049394221) internal successors, (5734), 4514 states have internal predecessors, (5734), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-06 21:36:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 5834 transitions. [2021-11-06 21:36:31,716 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 5834 transitions. Word has length 29 [2021-11-06 21:36:31,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:31,718 INFO L470 AbstractCegarLoop]: Abstraction has 4573 states and 5834 transitions. [2021-11-06 21:36:31,718 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 21:36:31,718 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 5834 transitions. [2021-11-06 21:36:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-06 21:36:31,722 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:31,722 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:31,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 21:36:31,722 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:31,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:31,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1517708890, now seen corresponding path program 1 times [2021-11-06 21:36:31,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:31,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642599012] [2021-11-06 21:36:31,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:31,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:31,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:31,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:31,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642599012] [2021-11-06 21:36:31,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642599012] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:31,863 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:31,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:31,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504934183] [2021-11-06 21:36:31,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:31,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:31,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:31,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:31,864 INFO L87 Difference]: Start difference. First operand 4573 states and 5834 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 21:36:31,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:31,962 INFO L93 Difference]: Finished difference Result 4573 states and 5834 transitions. [2021-11-06 21:36:31,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:31,963 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 21:36:31,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:31,971 INFO L225 Difference]: With dead ends: 4573 [2021-11-06 21:36:31,972 INFO L226 Difference]: Without dead ends: 4569 [2021-11-06 21:36:31,974 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:31,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2021-11-06 21:36:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 4569. [2021-11-06 21:36:32,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4569 states, 4290 states have (on average 1.3356643356643356) internal successors, (5730), 4510 states have internal predecessors, (5730), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-06 21:36:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4569 states to 4569 states and 5830 transitions. [2021-11-06 21:36:32,184 INFO L78 Accepts]: Start accepts. Automaton has 4569 states and 5830 transitions. Word has length 31 [2021-11-06 21:36:32,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:32,184 INFO L470 AbstractCegarLoop]: Abstraction has 4569 states and 5830 transitions. [2021-11-06 21:36:32,184 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 21:36:32,184 INFO L276 IsEmpty]: Start isEmpty. Operand 4569 states and 5830 transitions. [2021-11-06 21:36:32,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-06 21:36:32,186 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:32,186 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:32,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 21:36:32,186 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:32,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:32,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1770828394, now seen corresponding path program 1 times [2021-11-06 21:36:32,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:32,187 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509106916] [2021-11-06 21:36:32,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:32,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:32,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:32,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509106916] [2021-11-06 21:36:32,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509106916] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:32,334 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:32,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:32,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527004875] [2021-11-06 21:36:32,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:32,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:32,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:32,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:32,336 INFO L87 Difference]: Start difference. First operand 4569 states and 5830 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 21:36:32,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:32,445 INFO L93 Difference]: Finished difference Result 4569 states and 5830 transitions. [2021-11-06 21:36:32,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:32,445 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 21:36:32,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:32,454 INFO L225 Difference]: With dead ends: 4569 [2021-11-06 21:36:32,454 INFO L226 Difference]: Without dead ends: 4565 [2021-11-06 21:36:32,457 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4565 states. [2021-11-06 21:36:32,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4565 to 4565. [2021-11-06 21:36:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4565 states, 4288 states have (on average 1.3353544776119404) internal successors, (5726), 4506 states have internal predecessors, (5726), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-06 21:36:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 5826 transitions. [2021-11-06 21:36:32,566 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 5826 transitions. Word has length 33 [2021-11-06 21:36:32,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:32,566 INFO L470 AbstractCegarLoop]: Abstraction has 4565 states and 5826 transitions. [2021-11-06 21:36:32,566 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 21:36:32,566 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 5826 transitions. [2021-11-06 21:36:32,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-06 21:36:32,566 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:32,567 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:32,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 21:36:32,567 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:32,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:32,567 INFO L85 PathProgramCache]: Analyzing trace with hash 959227821, now seen corresponding path program 1 times [2021-11-06 21:36:32,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:32,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593704413] [2021-11-06 21:36:32,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:32,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:32,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:32,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593704413] [2021-11-06 21:36:32,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593704413] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:32,681 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:32,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:32,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383816972] [2021-11-06 21:36:32,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:32,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:32,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:32,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:32,683 INFO L87 Difference]: Start difference. First operand 4565 states and 5826 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 21:36:32,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:32,788 INFO L93 Difference]: Finished difference Result 4565 states and 5826 transitions. [2021-11-06 21:36:32,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:32,788 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 21:36:32,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:32,796 INFO L225 Difference]: With dead ends: 4565 [2021-11-06 21:36:32,796 INFO L226 Difference]: Without dead ends: 4561 [2021-11-06 21:36:32,798 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:32,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4561 states. [2021-11-06 21:36:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4561 to 4561. [2021-11-06 21:36:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4561 states, 4286 states have (on average 1.3350443303779749) internal successors, (5722), 4502 states have internal predecessors, (5722), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-06 21:36:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4561 states to 4561 states and 5822 transitions. [2021-11-06 21:36:32,911 INFO L78 Accepts]: Start accepts. Automaton has 4561 states and 5822 transitions. Word has length 35 [2021-11-06 21:36:32,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:32,912 INFO L470 AbstractCegarLoop]: Abstraction has 4561 states and 5822 transitions. [2021-11-06 21:36:32,912 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 21:36:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 4561 states and 5822 transitions. [2021-11-06 21:36:32,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-06 21:36:32,912 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:32,913 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:32,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 21:36:32,913 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:32,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:32,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1599840943, now seen corresponding path program 1 times [2021-11-06 21:36:32,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:32,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914385613] [2021-11-06 21:36:32,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:32,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:33,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:33,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914385613] [2021-11-06 21:36:33,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914385613] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:33,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:33,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:33,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583940048] [2021-11-06 21:36:33,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:33,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:33,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:33,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:33,030 INFO L87 Difference]: Start difference. First operand 4561 states and 5822 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 21:36:33,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:33,299 INFO L93 Difference]: Finished difference Result 8922 states and 11493 transitions. [2021-11-06 21:36:33,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:36:33,300 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 21:36:33,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:33,320 INFO L225 Difference]: With dead ends: 8922 [2021-11-06 21:36:33,320 INFO L226 Difference]: Without dead ends: 8918 [2021-11-06 21:36:33,326 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:33,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8918 states. [2021-11-06 21:36:33,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8918 to 8488. [2021-11-06 21:36:33,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8488 states, 8153 states have (on average 1.3488286520299277) internal successors, (10997), 8371 states have internal predecessors, (10997), 100 states have call successors, (100), 22 states have call predecessors, (100), 22 states have return successors, (150), 98 states have call predecessors, (150), 100 states have call successors, (150) [2021-11-06 21:36:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8488 states to 8488 states and 11247 transitions. [2021-11-06 21:36:33,621 INFO L78 Accepts]: Start accepts. Automaton has 8488 states and 11247 transitions. Word has length 37 [2021-11-06 21:36:33,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:33,622 INFO L470 AbstractCegarLoop]: Abstraction has 8488 states and 11247 transitions. [2021-11-06 21:36:33,623 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 21:36:33,623 INFO L276 IsEmpty]: Start isEmpty. Operand 8488 states and 11247 transitions. [2021-11-06 21:36:33,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-06 21:36:33,623 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:33,624 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:33,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 21:36:33,624 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:33,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:33,624 INFO L85 PathProgramCache]: Analyzing trace with hash 151337813, now seen corresponding path program 1 times [2021-11-06 21:36:33,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:33,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035697987] [2021-11-06 21:36:33,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:33,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:33,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:33,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035697987] [2021-11-06 21:36:33,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035697987] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:33,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:33,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:33,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906063942] [2021-11-06 21:36:33,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:33,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:33,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:33,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:33,766 INFO L87 Difference]: Start difference. First operand 8488 states and 11247 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 21:36:33,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:33,990 INFO L93 Difference]: Finished difference Result 8488 states and 11247 transitions. [2021-11-06 21:36:33,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:33,990 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 21:36:33,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:34,009 INFO L225 Difference]: With dead ends: 8488 [2021-11-06 21:36:34,009 INFO L226 Difference]: Without dead ends: 8484 [2021-11-06 21:36:34,015 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:34,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8484 states. [2021-11-06 21:36:34,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8484 to 8484. [2021-11-06 21:36:34,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8484 states, 8151 states have (on average 1.3486688749846645) internal successors, (10993), 8367 states have internal predecessors, (10993), 100 states have call successors, (100), 22 states have call predecessors, (100), 22 states have return successors, (150), 98 states have call predecessors, (150), 100 states have call successors, (150) [2021-11-06 21:36:34,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8484 states to 8484 states and 11243 transitions. [2021-11-06 21:36:34,295 INFO L78 Accepts]: Start accepts. Automaton has 8484 states and 11243 transitions. Word has length 39 [2021-11-06 21:36:34,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:34,295 INFO L470 AbstractCegarLoop]: Abstraction has 8484 states and 11243 transitions. [2021-11-06 21:36:34,295 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 21:36:34,296 INFO L276 IsEmpty]: Start isEmpty. Operand 8484 states and 11243 transitions. [2021-11-06 21:36:34,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 21:36:34,296 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:34,296 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:34,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 21:36:34,296 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:34,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:34,297 INFO L85 PathProgramCache]: Analyzing trace with hash -593057351, now seen corresponding path program 1 times [2021-11-06 21:36:34,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:34,297 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459908183] [2021-11-06 21:36:34,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:34,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:34,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:34,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:34,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459908183] [2021-11-06 21:36:34,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459908183] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:34,432 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:34,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:34,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449078170] [2021-11-06 21:36:34,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:34,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:34,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:34,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:34,433 INFO L87 Difference]: Start difference. First operand 8484 states and 11243 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 21:36:34,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:34,762 INFO L93 Difference]: Finished difference Result 8484 states and 11243 transitions. [2021-11-06 21:36:34,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:34,763 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 21:36:34,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:34,780 INFO L225 Difference]: With dead ends: 8484 [2021-11-06 21:36:34,780 INFO L226 Difference]: Without dead ends: 8480 [2021-11-06 21:36:34,784 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:34,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8480 states. [2021-11-06 21:36:35,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8480 to 8480. [2021-11-06 21:36:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8480 states, 8149 states have (on average 1.3485090195115965) internal successors, (10989), 8363 states have internal predecessors, (10989), 100 states have call successors, (100), 22 states have call predecessors, (100), 22 states have return successors, (150), 98 states have call predecessors, (150), 100 states have call successors, (150) [2021-11-06 21:36:35,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 11239 transitions. [2021-11-06 21:36:35,110 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 11239 transitions. Word has length 41 [2021-11-06 21:36:35,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:35,110 INFO L470 AbstractCegarLoop]: Abstraction has 8480 states and 11239 transitions. [2021-11-06 21:36:35,110 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 21:36:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 11239 transitions. [2021-11-06 21:36:35,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-06 21:36:35,110 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:35,111 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:35,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 21:36:35,111 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:35,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:35,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1302728829, now seen corresponding path program 1 times [2021-11-06 21:36:35,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:35,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71389929] [2021-11-06 21:36:35,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:35,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:35,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:35,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:35,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71389929] [2021-11-06 21:36:35,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71389929] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:35,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:35,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:35,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333949584] [2021-11-06 21:36:35,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:35,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:35,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:35,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:35,241 INFO L87 Difference]: Start difference. First operand 8480 states and 11239 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 21:36:35,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:35,523 INFO L93 Difference]: Finished difference Result 8480 states and 11239 transitions. [2021-11-06 21:36:35,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:35,524 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 21:36:35,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:35,540 INFO L225 Difference]: With dead ends: 8480 [2021-11-06 21:36:35,540 INFO L226 Difference]: Without dead ends: 8476 [2021-11-06 21:36:35,545 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:35,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8476 states. [2021-11-06 21:36:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8476 to 8476. [2021-11-06 21:36:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8476 states, 8147 states have (on average 1.3483490855529643) internal successors, (10985), 8359 states have internal predecessors, (10985), 100 states have call successors, (100), 22 states have call predecessors, (100), 22 states have return successors, (150), 98 states have call predecessors, (150), 100 states have call successors, (150) [2021-11-06 21:36:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8476 states to 8476 states and 11235 transitions. [2021-11-06 21:36:35,876 INFO L78 Accepts]: Start accepts. Automaton has 8476 states and 11235 transitions. Word has length 43 [2021-11-06 21:36:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:35,877 INFO L470 AbstractCegarLoop]: Abstraction has 8476 states and 11235 transitions. [2021-11-06 21:36:35,877 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 21:36:35,877 INFO L276 IsEmpty]: Start isEmpty. Operand 8476 states and 11235 transitions. [2021-11-06 21:36:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-06 21:36:35,877 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:35,877 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:35,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 21:36:35,878 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:35,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:35,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2087114657, now seen corresponding path program 1 times [2021-11-06 21:36:35,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:35,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251068402] [2021-11-06 21:36:35,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:35,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:35,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:35,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251068402] [2021-11-06 21:36:35,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251068402] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:35,994 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:35,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:35,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709550132] [2021-11-06 21:36:35,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:35,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:35,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:35,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:35,995 INFO L87 Difference]: Start difference. First operand 8476 states and 11235 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:36,209 INFO L93 Difference]: Finished difference Result 8476 states and 11235 transitions. [2021-11-06 21:36:36,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:36,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-06 21:36:36,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:36,224 INFO L225 Difference]: With dead ends: 8476 [2021-11-06 21:36:36,224 INFO L226 Difference]: Without dead ends: 8472 [2021-11-06 21:36:36,228 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:36,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8472 states. [2021-11-06 21:36:36,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8472 to 8472. [2021-11-06 21:36:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8472 states, 8145 states have (on average 1.3481890730509516) internal successors, (10981), 8355 states have internal predecessors, (10981), 100 states have call successors, (100), 22 states have call predecessors, (100), 22 states have return successors, (150), 98 states have call predecessors, (150), 100 states have call successors, (150) [2021-11-06 21:36:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8472 states to 8472 states and 11231 transitions. [2021-11-06 21:36:36,576 INFO L78 Accepts]: Start accepts. Automaton has 8472 states and 11231 transitions. Word has length 45 [2021-11-06 21:36:36,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:36,577 INFO L470 AbstractCegarLoop]: Abstraction has 8472 states and 11231 transitions. [2021-11-06 21:36:36,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:36,577 INFO L276 IsEmpty]: Start isEmpty. Operand 8472 states and 11231 transitions. [2021-11-06 21:36:36,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 21:36:36,577 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:36,577 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:36,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 21:36:36,578 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:36,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:36,578 INFO L85 PathProgramCache]: Analyzing trace with hash -32348379, now seen corresponding path program 1 times [2021-11-06 21:36:36,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:36,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265376251] [2021-11-06 21:36:36,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:36,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:36,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:36,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:36,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265376251] [2021-11-06 21:36:36,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265376251] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:36,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:36,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:36,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496361906] [2021-11-06 21:36:36,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:36,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:36,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:36,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:36,731 INFO L87 Difference]: Start difference. First operand 8472 states and 11231 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:36,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:36,979 INFO L93 Difference]: Finished difference Result 8472 states and 11231 transitions. [2021-11-06 21:36:36,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:36,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-06 21:36:36,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:36,998 INFO L225 Difference]: With dead ends: 8472 [2021-11-06 21:36:36,998 INFO L226 Difference]: Without dead ends: 8468 [2021-11-06 21:36:37,004 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:37,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8468 states. [2021-11-06 21:36:37,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8468 to 8468. [2021-11-06 21:36:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8468 states, 8143 states have (on average 1.3480289819476852) internal successors, (10977), 8351 states have internal predecessors, (10977), 100 states have call successors, (100), 22 states have call predecessors, (100), 22 states have return successors, (150), 98 states have call predecessors, (150), 100 states have call successors, (150) [2021-11-06 21:36:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8468 states to 8468 states and 11227 transitions. [2021-11-06 21:36:37,297 INFO L78 Accepts]: Start accepts. Automaton has 8468 states and 11227 transitions. Word has length 47 [2021-11-06 21:36:37,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:37,297 INFO L470 AbstractCegarLoop]: Abstraction has 8468 states and 11227 transitions. [2021-11-06 21:36:37,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 8468 states and 11227 transitions. [2021-11-06 21:36:37,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-06 21:36:37,298 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:37,298 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:37,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 21:36:37,298 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:37,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:37,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1021827319, now seen corresponding path program 1 times [2021-11-06 21:36:37,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:37,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029153474] [2021-11-06 21:36:37,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:37,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:37,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:37,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029153474] [2021-11-06 21:36:37,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029153474] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:37,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:37,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:37,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459278968] [2021-11-06 21:36:37,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:37,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:37,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:37,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:37,512 INFO L87 Difference]: Start difference. First operand 8468 states and 11227 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:37,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:37,779 INFO L93 Difference]: Finished difference Result 8468 states and 11227 transitions. [2021-11-06 21:36:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:37,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-11-06 21:36:37,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:37,798 INFO L225 Difference]: With dead ends: 8468 [2021-11-06 21:36:37,798 INFO L226 Difference]: Without dead ends: 8464 [2021-11-06 21:36:37,803 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:37,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8464 states. [2021-11-06 21:36:38,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8464 to 8464. [2021-11-06 21:36:38,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8464 states, 8141 states have (on average 1.3478688121852351) internal successors, (10973), 8347 states have internal predecessors, (10973), 100 states have call successors, (100), 22 states have call predecessors, (100), 22 states have return successors, (150), 98 states have call predecessors, (150), 100 states have call successors, (150) [2021-11-06 21:36:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8464 states to 8464 states and 11223 transitions. [2021-11-06 21:36:38,154 INFO L78 Accepts]: Start accepts. Automaton has 8464 states and 11223 transitions. Word has length 49 [2021-11-06 21:36:38,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:38,154 INFO L470 AbstractCegarLoop]: Abstraction has 8464 states and 11223 transitions. [2021-11-06 21:36:38,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:38,155 INFO L276 IsEmpty]: Start isEmpty. Operand 8464 states and 11223 transitions. [2021-11-06 21:36:38,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 21:36:38,155 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:38,155 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:38,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 21:36:38,155 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:38,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:38,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1571651405, now seen corresponding path program 1 times [2021-11-06 21:36:38,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:38,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521614260] [2021-11-06 21:36:38,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:38,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:38,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:38,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521614260] [2021-11-06 21:36:38,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521614260] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:38,303 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:38,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:38,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66327648] [2021-11-06 21:36:38,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:38,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:38,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:38,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:38,305 INFO L87 Difference]: Start difference. First operand 8464 states and 11223 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:38,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:38,546 INFO L93 Difference]: Finished difference Result 8464 states and 11223 transitions. [2021-11-06 21:36:38,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:38,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-06 21:36:38,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:38,565 INFO L225 Difference]: With dead ends: 8464 [2021-11-06 21:36:38,565 INFO L226 Difference]: Without dead ends: 8460 [2021-11-06 21:36:38,569 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:38,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8460 states. [2021-11-06 21:36:38,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8460 to 8460. [2021-11-06 21:36:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8460 states, 8139 states have (on average 1.347708563705615) internal successors, (10969), 8343 states have internal predecessors, (10969), 100 states have call successors, (100), 22 states have call predecessors, (100), 22 states have return successors, (150), 98 states have call predecessors, (150), 100 states have call successors, (150) [2021-11-06 21:36:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11219 transitions. [2021-11-06 21:36:38,867 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11219 transitions. Word has length 51 [2021-11-06 21:36:38,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:38,867 INFO L470 AbstractCegarLoop]: Abstraction has 8460 states and 11219 transitions. [2021-11-06 21:36:38,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11219 transitions. [2021-11-06 21:36:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 21:36:38,868 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:38,868 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:38,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 21:36:38,868 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:38,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:38,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1471293455, now seen corresponding path program 1 times [2021-11-06 21:36:38,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:38,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087623330] [2021-11-06 21:36:38,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:38,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:39,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:39,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087623330] [2021-11-06 21:36:39,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087623330] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:39,009 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:39,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:39,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397284600] [2021-11-06 21:36:39,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:39,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:39,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:39,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:39,011 INFO L87 Difference]: Start difference. First operand 8460 states and 11219 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:39,340 INFO L93 Difference]: Finished difference Result 8460 states and 11219 transitions. [2021-11-06 21:36:39,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:39,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-06 21:36:39,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:39,356 INFO L225 Difference]: With dead ends: 8460 [2021-11-06 21:36:39,356 INFO L226 Difference]: Without dead ends: 8456 [2021-11-06 21:36:39,359 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:39,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8456 states. [2021-11-06 21:36:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8456 to 8456. [2021-11-06 21:36:39,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8456 states, 8137 states have (on average 1.3475482364507805) internal successors, (10965), 8339 states have internal predecessors, (10965), 100 states have call successors, (100), 22 states have call predecessors, (100), 22 states have return successors, (150), 98 states have call predecessors, (150), 100 states have call successors, (150) [2021-11-06 21:36:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8456 states to 8456 states and 11215 transitions. [2021-11-06 21:36:39,647 INFO L78 Accepts]: Start accepts. Automaton has 8456 states and 11215 transitions. Word has length 53 [2021-11-06 21:36:39,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:39,648 INFO L470 AbstractCegarLoop]: Abstraction has 8456 states and 11215 transitions. [2021-11-06 21:36:39,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:39,648 INFO L276 IsEmpty]: Start isEmpty. Operand 8456 states and 11215 transitions. [2021-11-06 21:36:39,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 21:36:39,648 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:39,649 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:39,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 21:36:39,649 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:39,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:39,649 INFO L85 PathProgramCache]: Analyzing trace with hash -868574987, now seen corresponding path program 1 times [2021-11-06 21:36:39,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:39,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024765827] [2021-11-06 21:36:39,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:39,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:39,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:39,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024765827] [2021-11-06 21:36:39,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024765827] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:39,778 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:39,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:39,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875210701] [2021-11-06 21:36:39,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:39,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:39,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:39,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:39,780 INFO L87 Difference]: Start difference. First operand 8456 states and 11215 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:40,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:40,407 INFO L93 Difference]: Finished difference Result 16730 states and 22397 transitions. [2021-11-06 21:36:40,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:36:40,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-06 21:36:40,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:40,451 INFO L225 Difference]: With dead ends: 16730 [2021-11-06 21:36:40,452 INFO L226 Difference]: Without dead ends: 16726 [2021-11-06 21:36:40,460 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:40,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16726 states. [2021-11-06 21:36:41,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16726 to 16296. [2021-11-06 21:36:41,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16296 states, 15856 states have (on average 1.3550075681130171) internal successors, (21485), 16063 states have internal predecessors, (21485), 200 states have call successors, (200), 44 states have call predecessors, (200), 44 states have return successors, (450), 196 states have call predecessors, (450), 200 states have call successors, (450) [2021-11-06 21:36:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16296 states to 16296 states and 22135 transitions. [2021-11-06 21:36:41,312 INFO L78 Accepts]: Start accepts. Automaton has 16296 states and 22135 transitions. Word has length 55 [2021-11-06 21:36:41,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:41,312 INFO L470 AbstractCegarLoop]: Abstraction has 16296 states and 22135 transitions. [2021-11-06 21:36:41,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:41,313 INFO L276 IsEmpty]: Start isEmpty. Operand 16296 states and 22135 transitions. [2021-11-06 21:36:41,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 21:36:41,313 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:41,313 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:41,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 21:36:41,314 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:41,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:41,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1476711847, now seen corresponding path program 1 times [2021-11-06 21:36:41,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:41,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948126098] [2021-11-06 21:36:41,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:41,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:41,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:41,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948126098] [2021-11-06 21:36:41,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948126098] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:41,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:41,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:41,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571829633] [2021-11-06 21:36:41,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:41,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:41,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:41,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:41,454 INFO L87 Difference]: Start difference. First operand 16296 states and 22135 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:41,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:41,952 INFO L93 Difference]: Finished difference Result 16296 states and 22135 transitions. [2021-11-06 21:36:41,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:41,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-06 21:36:41,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:41,992 INFO L225 Difference]: With dead ends: 16296 [2021-11-06 21:36:41,993 INFO L226 Difference]: Without dead ends: 16292 [2021-11-06 21:36:42,001 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:42,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16292 states. [2021-11-06 21:36:42,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16292 to 16292. [2021-11-06 21:36:42,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16292 states, 15854 states have (on average 1.3549262015895043) internal successors, (21481), 16059 states have internal predecessors, (21481), 200 states have call successors, (200), 44 states have call predecessors, (200), 44 states have return successors, (450), 196 states have call predecessors, (450), 200 states have call successors, (450) [2021-11-06 21:36:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16292 states to 16292 states and 22131 transitions. [2021-11-06 21:36:42,752 INFO L78 Accepts]: Start accepts. Automaton has 16292 states and 22131 transitions. Word has length 57 [2021-11-06 21:36:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:42,752 INFO L470 AbstractCegarLoop]: Abstraction has 16292 states and 22131 transitions. [2021-11-06 21:36:42,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:42,753 INFO L276 IsEmpty]: Start isEmpty. Operand 16292 states and 22131 transitions. [2021-11-06 21:36:42,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 21:36:42,754 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:42,754 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:42,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 21:36:42,755 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:42,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:42,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1780681699, now seen corresponding path program 1 times [2021-11-06 21:36:42,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:42,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141789988] [2021-11-06 21:36:42,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:42,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:42,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:42,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141789988] [2021-11-06 21:36:42,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141789988] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:42,886 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:42,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:42,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815322769] [2021-11-06 21:36:42,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:42,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:42,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:42,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:42,888 INFO L87 Difference]: Start difference. First operand 16292 states and 22131 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:44,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:44,133 INFO L93 Difference]: Finished difference Result 32406 states and 44533 transitions. [2021-11-06 21:36:44,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:44,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-06 21:36:44,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:44,210 INFO L225 Difference]: With dead ends: 32406 [2021-11-06 21:36:44,211 INFO L226 Difference]: Without dead ends: 32284 [2021-11-06 21:36:44,224 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:44,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32284 states. [2021-11-06 21:36:45,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32284 to 31820. [2021-11-06 21:36:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31820 states, 31139 states have (on average 1.3598060310221909) internal successors, (42343), 31355 states have internal predecessors, (42343), 400 states have call successors, (400), 88 states have call predecessors, (400), 88 states have return successors, (1350), 392 states have call predecessors, (1350), 400 states have call successors, (1350) [2021-11-06 21:36:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31820 states to 31820 states and 44093 transitions. [2021-11-06 21:36:45,626 INFO L78 Accepts]: Start accepts. Automaton has 31820 states and 44093 transitions. Word has length 59 [2021-11-06 21:36:45,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:45,627 INFO L470 AbstractCegarLoop]: Abstraction has 31820 states and 44093 transitions. [2021-11-06 21:36:45,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:45,627 INFO L276 IsEmpty]: Start isEmpty. Operand 31820 states and 44093 transitions. [2021-11-06 21:36:45,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-06 21:36:45,628 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:45,628 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:45,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 21:36:45,628 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:45,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:45,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1653087338, now seen corresponding path program 1 times [2021-11-06 21:36:45,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:45,628 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813464968] [2021-11-06 21:36:45,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:45,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:46,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:46,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813464968] [2021-11-06 21:36:46,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813464968] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:46,135 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:46,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 21:36:46,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570792058] [2021-11-06 21:36:46,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:36:46,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:46,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:36:46,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:46,136 INFO L87 Difference]: Start difference. First operand 31820 states and 44093 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:48,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:48,846 INFO L93 Difference]: Finished difference Result 75824 states and 104751 transitions. [2021-11-06 21:36:48,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:36:48,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2021-11-06 21:36:48,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:48,971 INFO L225 Difference]: With dead ends: 75824 [2021-11-06 21:36:48,971 INFO L226 Difference]: Without dead ends: 44137 [2021-11-06 21:36:49,118 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 21:36:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44137 states. [2021-11-06 21:36:51,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44137 to 31832. [2021-11-06 21:36:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31832 states, 31151 states have (on average 1.3595390196141375) internal successors, (42351), 31367 states have internal predecessors, (42351), 400 states have call successors, (400), 88 states have call predecessors, (400), 88 states have return successors, (1350), 392 states have call predecessors, (1350), 400 states have call successors, (1350) [2021-11-06 21:36:51,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31832 states to 31832 states and 44101 transitions. [2021-11-06 21:36:51,166 INFO L78 Accepts]: Start accepts. Automaton has 31832 states and 44101 transitions. Word has length 155 [2021-11-06 21:36:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:51,167 INFO L470 AbstractCegarLoop]: Abstraction has 31832 states and 44101 transitions. [2021-11-06 21:36:51,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 31832 states and 44101 transitions. [2021-11-06 21:36:51,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-06 21:36:51,168 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:51,168 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:51,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 21:36:51,169 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:51,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:51,169 INFO L85 PathProgramCache]: Analyzing trace with hash 121920024, now seen corresponding path program 1 times [2021-11-06 21:36:51,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:51,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410962481] [2021-11-06 21:36:51,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:51,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:51,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:51,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410962481] [2021-11-06 21:36:51,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410962481] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:51,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:51,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:51,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329296048] [2021-11-06 21:36:51,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:36:51,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:51,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:36:51,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:36:51,320 INFO L87 Difference]: Start difference. First operand 31832 states and 44101 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:53,658 INFO L93 Difference]: Finished difference Result 75686 states and 104572 transitions. [2021-11-06 21:36:53,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:36:53,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2021-11-06 21:36:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:53,765 INFO L225 Difference]: With dead ends: 75686 [2021-11-06 21:36:53,765 INFO L226 Difference]: Without dead ends: 43987 [2021-11-06 21:36:53,881 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:36:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43987 states. [2021-11-06 21:36:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43987 to 31816. [2021-11-06 21:36:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31816 states, 31135 states have (on average 1.3593383651838766) internal successors, (42323), 31351 states have internal predecessors, (42323), 400 states have call successors, (400), 88 states have call predecessors, (400), 88 states have return successors, (1350), 392 states have call predecessors, (1350), 400 states have call successors, (1350) [2021-11-06 21:36:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31816 states to 31816 states and 44073 transitions. [2021-11-06 21:36:55,981 INFO L78 Accepts]: Start accepts. Automaton has 31816 states and 44073 transitions. Word has length 155 [2021-11-06 21:36:55,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:55,981 INFO L470 AbstractCegarLoop]: Abstraction has 31816 states and 44073 transitions. [2021-11-06 21:36:55,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 31816 states and 44073 transitions. [2021-11-06 21:36:55,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-06 21:36:55,982 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:55,982 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:55,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 21:36:55,983 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:36:55,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:55,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2053567812, now seen corresponding path program 1 times [2021-11-06 21:36:55,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:55,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308744653] [2021-11-06 21:36:55,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:55,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:56,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:56,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:56,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308744653] [2021-11-06 21:36:56,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308744653] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:56,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:56,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:36:56,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565117121] [2021-11-06 21:36:56,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:36:56,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:56,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:36:56,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:56,206 INFO L87 Difference]: Start difference. First operand 31816 states and 44073 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:37:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:37:02,031 INFO L93 Difference]: Finished difference Result 60704 states and 83888 transitions. [2021-11-06 21:37:02,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 21:37:02,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2021-11-06 21:37:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:37:02,181 INFO L225 Difference]: With dead ends: 60704 [2021-11-06 21:37:02,181 INFO L226 Difference]: Without dead ends: 60702 [2021-11-06 21:37:02,203 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 21:37:02,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60702 states. [2021-11-06 21:37:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60702 to 47260. [2021-11-06 21:37:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47260 states, 46335 states have (on average 1.361972590913996) internal successors, (63107), 46563 states have internal predecessors, (63107), 600 states have call successors, (600), 132 states have call predecessors, (600), 132 states have return successors, (2700), 588 states have call predecessors, (2700), 600 states have call successors, (2700) [2021-11-06 21:37:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47260 states to 47260 states and 66407 transitions. [2021-11-06 21:37:04,984 INFO L78 Accepts]: Start accepts. Automaton has 47260 states and 66407 transitions. Word has length 157 [2021-11-06 21:37:04,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:37:04,985 INFO L470 AbstractCegarLoop]: Abstraction has 47260 states and 66407 transitions. [2021-11-06 21:37:04,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:37:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 47260 states and 66407 transitions. [2021-11-06 21:37:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-06 21:37:04,987 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:37:04,987 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:37:04,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 21:37:04,987 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting vidioc_streamonErr0ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:37:04,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:37:04,988 INFO L85 PathProgramCache]: Analyzing trace with hash 706207964, now seen corresponding path program 1 times [2021-11-06 21:37:04,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:37:04,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319129640] [2021-11-06 21:37:04,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:37:04,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:37:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:37:05,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:37:05,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:37:05,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319129640] [2021-11-06 21:37:05,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319129640] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:37:05,249 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:37:05,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:37:05,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147731441] [2021-11-06 21:37:05,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:37:05,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:37:05,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:37:05,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:37:05,251 INFO L87 Difference]: Start difference. First operand 47260 states and 66407 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:37:11,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:37:11,066 INFO L93 Difference]: Finished difference Result 93333 states and 135118 transitions. [2021-11-06 21:37:11,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:37:11,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2021-11-06 21:37:11,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:37:11,309 INFO L225 Difference]: With dead ends: 93333 [2021-11-06 21:37:11,310 INFO L226 Difference]: Without dead ends: 93331 [2021-11-06 21:37:11,349 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:37:11,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93331 states. [2021-11-06 21:37:16,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93331 to 84996. [2021-11-06 21:37:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84996 states, 83339 states have (on average 1.3575156889331526) internal successors, (113134), 83735 states have internal predecessors, (113134), 1176 states have call successors, (1176), 264 states have call predecessors, (1176), 288 states have return successors, (9210), 1032 states have call predecessors, (9210), 1176 states have call successors, (9210) [2021-11-06 21:37:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84996 states to 84996 states and 123520 transitions. [2021-11-06 21:37:17,088 INFO L78 Accepts]: Start accepts. Automaton has 84996 states and 123520 transitions. Word has length 178 [2021-11-06 21:37:17,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:37:17,088 INFO L470 AbstractCegarLoop]: Abstraction has 84996 states and 123520 transitions. [2021-11-06 21:37:17,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:37:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 84996 states and 123520 transitions. [2021-11-06 21:37:17,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-11-06 21:37:17,091 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:37:17,091 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:37:17,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 21:37:17,091 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting vidioc_streamoffErr0ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 229 more)] === [2021-11-06 21:37:17,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:37:17,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1561983756, now seen corresponding path program 1 times [2021-11-06 21:37:17,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:37:17,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805001454] [2021-11-06 21:37:17,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:37:17,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:37:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat