/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 05:46:21,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 05:46:21,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 05:46:21,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 05:46:21,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 05:46:21,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 05:46:21,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 05:46:21,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 05:46:21,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 05:46:21,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 05:46:21,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 05:46:21,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 05:46:21,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 05:46:21,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 05:46:21,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 05:46:21,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 05:46:21,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 05:46:21,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 05:46:21,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 05:46:21,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 05:46:21,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 05:46:21,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 05:46:21,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 05:46:21,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 05:46:21,382 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 05:46:21,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 05:46:21,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 05:46:21,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 05:46:21,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 05:46:21,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 05:46:21,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 05:46:21,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 05:46:21,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 05:46:21,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 05:46:21,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 05:46:21,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 05:46:21,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 05:46:21,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 05:46:21,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 05:46:21,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 05:46:21,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 05:46:21,401 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2021-01-07 05:46:21,436 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 05:46:21,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 05:46:21,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 05:46:21,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 05:46:21,439 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 05:46:21,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 05:46:21,440 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 05:46:21,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 05:46:21,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 05:46:21,441 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 05:46:21,441 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 05:46:21,442 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-01-07 05:46:21,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 05:46:21,442 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 05:46:21,443 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 05:46:21,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 05:46:21,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 05:46:21,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 05:46:21,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:46:21,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 05:46:21,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 05:46:21,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 05:46:21,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 05:46:21,445 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 05:46:21,446 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-bitabs/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 [2021-01-07 05:46:21,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 05:46:22,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 05:46:22,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 05:46:22,056 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 05:46:22,057 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 05:46:22,059 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2021-01-07 05:46:22,182 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/628d6ec42/1c85620c071246998638115b962ed96f/FLAG2f9787f8a [2021-01-07 05:46:22,981 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 05:46:22,982 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2021-01-07 05:46:23,009 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/628d6ec42/1c85620c071246998638115b962ed96f/FLAG2f9787f8a [2021-01-07 05:46:23,271 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/628d6ec42/1c85620c071246998638115b962ed96f [2021-01-07 05:46:23,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 05:46:23,284 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 05:46:23,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 05:46:23,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 05:46:23,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 05:46:23,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:46:23" (1/1) ... [2021-01-07 05:46:23,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed7c0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:46:23, skipping insertion in model container [2021-01-07 05:46:23,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:46:23" (1/1) ... [2021-01-07 05:46:23,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 05:46:23,396 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pended~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compFptr~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compRegistered~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~UNLOADED~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~NP~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~DC~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~SKIP1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~SKIP2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~MPR1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~MPR3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~IPC~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pended~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compFptr~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compRegistered~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~devExt~0,] left hand side expression in assignment: lhs: VariableLHS[~irpStack~0,] left hand side expression in assignment: lhs: VariableLHS[~irpSp~0,] left hand side expression in assignment: lhs: VariableLHS[~nextIrpSp~0,] left hand side expression in assignment: lhs: VariableLHS[~nextIrpSp__Control~0,] left hand side expression in assignment: lhs: VariableLHS[~compRegistered~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~irpSp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~irpSp__Context~0,] left hand side expression in assignment: lhs: VariableLHS[~irpSp__Control~0,] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp23~0,] left hand side expression in assignment: lhs: VariableLHS[~devExt__Started~0,] left hand side expression in assignment: lhs: VariableLHS[~devExt__Removed~0,] left hand side expression in assignment: lhs: VariableLHS[~devExt__SurpriseRemoved~0,] left hand side expression in assignment: lhs: VariableLHS[~Irp__IoStatus__Status~0,] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~Irp__IoStatus__Information~0,] left hand side expression in assignment: lhs: VariableLHS[~devExt__SurpriseRemoved~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~devExt__Removed~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~KernelMode~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~Executive~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~DevicePowerState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~UNLOADED~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~NP~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~DC~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~SKIP1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~SKIP2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~MPR1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~MPR3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~IPC~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pended~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compFptr~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compRegistered~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~pirp~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compRegistered~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pended~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pirp__IoStatus__Status~0,] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pirp__IoStatus__Status~0,] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compRetStatus~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal2~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal2~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal2~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~event~1,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~Irp__IoStatus__Status~1,] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~irpStack~1,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~devExt__DeviceState~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~compRetStatus~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~1,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~Irp__IoStatus__Information~1,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~connectData~0,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~hookKeyboard~0,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~Irp__IoStatus__Status~2,] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] [2021-01-07 05:46:23,742 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c[29656,29669] [2021-01-07 05:46:23,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:46:23,771 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pended~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compFptr~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compRegistered~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~UNLOADED~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~NP~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~DC~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~SKIP1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~SKIP2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~MPR1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~MPR3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~IPC~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pended~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compFptr~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compRegistered~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~devExt~0,] left hand side expression in assignment: lhs: VariableLHS[~irpStack~0,] left hand side expression in assignment: lhs: VariableLHS[~irpSp~0,] left hand side expression in assignment: lhs: VariableLHS[~nextIrpSp~0,] left hand side expression in assignment: lhs: VariableLHS[~nextIrpSp__Control~0,] left hand side expression in assignment: lhs: VariableLHS[~compRegistered~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~irpSp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~irpSp__Context~0,] left hand side expression in assignment: lhs: VariableLHS[~irpSp__Control~0,] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp23~0,] left hand side expression in assignment: lhs: VariableLHS[~devExt__Started~0,] left hand side expression in assignment: lhs: VariableLHS[~devExt__Removed~0,] left hand side expression in assignment: lhs: VariableLHS[~devExt__SurpriseRemoved~0,] left hand side expression in assignment: lhs: VariableLHS[~Irp__IoStatus__Status~0,] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~Irp__IoStatus__Information~0,] left hand side expression in assignment: lhs: VariableLHS[~devExt__SurpriseRemoved~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~devExt__Removed~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~KernelMode~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~Executive~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~DevicePowerState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~UNLOADED~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~NP~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~DC~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~SKIP1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~SKIP2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~MPR1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~MPR3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~IPC~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pended~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compFptr~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compRegistered~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~pirp~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compRegistered~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pended~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pirp__IoStatus__Status~0,] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pirp__IoStatus__Status~0,] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compRetStatus~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal2~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal2~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal2~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~event~1,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~Irp__IoStatus__Status~1,] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~irpStack~1,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~devExt__DeviceState~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~compRetStatus~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~1,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~Irp__IoStatus__Information~1,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~connectData~0,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~hookKeyboard~0,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~Irp__IoStatus__Status~2,] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] [2021-01-07 05:46:23,918 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c[29656,29669] [2021-01-07 05:46:23,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:46:23,959 INFO L208 MainTranslator]: Completed translation [2021-01-07 05:46:23,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:46:23 WrapperNode [2021-01-07 05:46:23,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 05:46:23,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 05:46:23,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 05:46:23,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 05:46:23,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:46:23" (1/1) ... [2021-01-07 05:46:23,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:46:23" (1/1) ... [2021-01-07 05:46:24,106 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 05:46:24,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 05:46:24,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 05:46:24,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 05:46:24,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:46:23" (1/1) ... [2021-01-07 05:46:24,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:46:23" (1/1) ... [2021-01-07 05:46:24,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:46:23" (1/1) ... [2021-01-07 05:46:24,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:46:23" (1/1) ... [2021-01-07 05:46:24,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:46:23" (1/1) ... [2021-01-07 05:46:24,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:46:23" (1/1) ... [2021-01-07 05:46:24,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:46:23" (1/1) ... [2021-01-07 05:46:24,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 05:46:24,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 05:46:24,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 05:46:24,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 05:46:24,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:46:23" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:46:24,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 05:46:24,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 05:46:24,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 05:46:24,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 05:46:24,917 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-07 05:46:24,926 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-07 05:46:24,941 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-07 05:46:24,956 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-07 05:46:24,963 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-07 05:46:24,971 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-07 05:46:24,978 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-07 05:46:24,990 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-07 05:46:24,996 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-07 05:46:25,001 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-07 05:46:25,007 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-07 05:46:25,020 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-07 05:46:26,477 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-01-07 05:46:26,477 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-01-07 05:46:26,478 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2021-01-07 05:46:26,478 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2021-01-07 05:46:26,479 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##219: assume false; [2021-01-07 05:46:26,479 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##220: assume !false; [2021-01-07 05:46:26,481 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2021-01-07 05:46:26,481 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2021-01-07 05:46:26,482 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##322: assume !false; [2021-01-07 05:46:26,482 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##321: assume false; [2021-01-07 05:46:26,484 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-01-07 05:46:26,485 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-01-07 05:46:26,485 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2021-01-07 05:46:26,485 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2021-01-07 05:46:26,486 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume !false; [2021-01-07 05:46:26,486 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume false; [2021-01-07 05:46:26,488 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume false; [2021-01-07 05:46:26,488 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume !false; [2021-01-07 05:46:26,489 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##389: assume !false; [2021-01-07 05:46:26,489 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##388: assume false; [2021-01-07 05:46:26,489 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-01-07 05:46:26,489 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-01-07 05:46:26,490 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !false; [2021-01-07 05:46:26,490 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume false; [2021-01-07 05:46:26,523 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 05:46:26,524 INFO L299 CfgBuilder]: Removed 154 assume(true) statements. [2021-01-07 05:46:26,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:46:26 BoogieIcfgContainer [2021-01-07 05:46:26,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 05:46:26,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 05:46:26,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 05:46:26,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 05:46:26,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 05:46:23" (1/3) ... [2021-01-07 05:46:26,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c2a39a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:46:26, skipping insertion in model container [2021-01-07 05:46:26,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:46:23" (2/3) ... [2021-01-07 05:46:26,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c2a39a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:46:26, skipping insertion in model container [2021-01-07 05:46:26,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:46:26" (3/3) ... [2021-01-07 05:46:26,545 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2021-01-07 05:46:26,558 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 05:46:26,566 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2021-01-07 05:46:26,595 INFO L253 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2021-01-07 05:46:26,640 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 05:46:26,641 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 05:46:26,641 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 05:46:26,641 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 05:46:26,641 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 05:46:26,642 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 05:46:26,642 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 05:46:26,643 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 05:46:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states. [2021-01-07 05:46:26,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-01-07 05:46:26,701 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:26,702 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:46:26,703 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:26,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:26,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1805892157, now seen corresponding path program 1 times [2021-01-07 05:46:26,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:26,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082270029] [2021-01-07 05:46:26,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:26,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082270029] [2021-01-07 05:46:26,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:26,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:46:26,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627062075] [2021-01-07 05:46:27,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:46:27,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:27,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:46:27,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:46:27,026 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 3 states. [2021-01-07 05:46:27,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:27,134 INFO L93 Difference]: Finished difference Result 335 states and 461 transitions. [2021-01-07 05:46:27,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:46:27,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2021-01-07 05:46:27,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:27,157 INFO L225 Difference]: With dead ends: 335 [2021-01-07 05:46:27,158 INFO L226 Difference]: Without dead ends: 331 [2021-01-07 05:46:27,160 INFO L677 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-01-07 05:46:27,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-01-07 05:46:27,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2021-01-07 05:46:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2021-01-07 05:46:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 456 transitions. [2021-01-07 05:46:27,244 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 456 transitions. Word has length 7 [2021-01-07 05:46:27,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:27,245 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 456 transitions. [2021-01-07 05:46:27,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:46:27,245 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 456 transitions. [2021-01-07 05:46:27,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-07 05:46:27,247 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:27,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:46:27,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 05:46:27,248 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:27,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:27,249 INFO L82 PathProgramCache]: Analyzing trace with hash 557701687, now seen corresponding path program 1 times [2021-01-07 05:46:27,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:27,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822101860] [2021-01-07 05:46:27,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:27,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:27,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822101860] [2021-01-07 05:46:27,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:27,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:46:27,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069863941] [2021-01-07 05:46:27,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:46:27,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:27,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:46:27,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:46:27,414 INFO L87 Difference]: Start difference. First operand 329 states and 456 transitions. Second operand 3 states. [2021-01-07 05:46:27,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:27,905 INFO L93 Difference]: Finished difference Result 378 states and 524 transitions. [2021-01-07 05:46:27,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:46:27,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2021-01-07 05:46:27,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:27,909 INFO L225 Difference]: With dead ends: 378 [2021-01-07 05:46:27,910 INFO L226 Difference]: Without dead ends: 378 [2021-01-07 05:46:27,911 INFO L677 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-01-07 05:46:27,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-01-07 05:46:27,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 357. [2021-01-07 05:46:27,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2021-01-07 05:46:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 495 transitions. [2021-01-07 05:46:27,941 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 495 transitions. Word has length 13 [2021-01-07 05:46:27,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:27,942 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 495 transitions. [2021-01-07 05:46:27,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:46:27,942 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 495 transitions. [2021-01-07 05:46:27,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-07 05:46:27,943 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:27,943 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:46:27,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 05:46:27,944 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:27,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:27,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1801870968, now seen corresponding path program 1 times [2021-01-07 05:46:27,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:27,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131315288] [2021-01-07 05:46:27,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:28,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131315288] [2021-01-07 05:46:28,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:28,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:46:28,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888827197] [2021-01-07 05:46:28,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:46:28,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:28,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:46:28,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:46:28,069 INFO L87 Difference]: Start difference. First operand 357 states and 495 transitions. Second operand 3 states. [2021-01-07 05:46:28,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:28,080 INFO L93 Difference]: Finished difference Result 356 states and 494 transitions. [2021-01-07 05:46:28,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:46:28,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2021-01-07 05:46:28,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:28,084 INFO L225 Difference]: With dead ends: 356 [2021-01-07 05:46:28,084 INFO L226 Difference]: Without dead ends: 351 [2021-01-07 05:46:28,085 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:46:28,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2021-01-07 05:46:28,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2021-01-07 05:46:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2021-01-07 05:46:28,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 479 transitions. [2021-01-07 05:46:28,104 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 479 transitions. Word has length 13 [2021-01-07 05:46:28,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:28,104 INFO L481 AbstractCegarLoop]: Abstraction has 351 states and 479 transitions. [2021-01-07 05:46:28,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:46:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 479 transitions. [2021-01-07 05:46:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-07 05:46:28,106 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:28,106 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:46:28,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 05:46:28,106 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:28,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:28,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1900748477, now seen corresponding path program 1 times [2021-01-07 05:46:28,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:28,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197944986] [2021-01-07 05:46:28,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:28,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197944986] [2021-01-07 05:46:28,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:28,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:46:28,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917342547] [2021-01-07 05:46:28,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:46:28,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:28,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:46:28,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:46:28,184 INFO L87 Difference]: Start difference. First operand 351 states and 479 transitions. Second operand 3 states. [2021-01-07 05:46:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:28,238 INFO L93 Difference]: Finished difference Result 362 states and 491 transitions. [2021-01-07 05:46:28,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:46:28,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2021-01-07 05:46:28,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:28,245 INFO L225 Difference]: With dead ends: 362 [2021-01-07 05:46:28,245 INFO L226 Difference]: Without dead ends: 362 [2021-01-07 05:46:28,246 INFO L677 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-01-07 05:46:28,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-01-07 05:46:28,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 307. [2021-01-07 05:46:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2021-01-07 05:46:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 421 transitions. [2021-01-07 05:46:28,289 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 421 transitions. Word has length 15 [2021-01-07 05:46:28,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:28,289 INFO L481 AbstractCegarLoop]: Abstraction has 307 states and 421 transitions. [2021-01-07 05:46:28,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:46:28,289 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 421 transitions. [2021-01-07 05:46:28,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-07 05:46:28,298 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:28,298 INFO L422 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-01-07 05:46:28,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 05:46:28,299 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:28,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:28,303 INFO L82 PathProgramCache]: Analyzing trace with hash 306593718, now seen corresponding path program 1 times [2021-01-07 05:46:28,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:28,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128157323] [2021-01-07 05:46:28,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:28,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:28,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128157323] [2021-01-07 05:46:28,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:28,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:46:28,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81590066] [2021-01-07 05:46:28,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:46:28,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:28,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:46:28,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:46:28,423 INFO L87 Difference]: Start difference. First operand 307 states and 421 transitions. Second operand 3 states. [2021-01-07 05:46:28,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:28,615 INFO L93 Difference]: Finished difference Result 293 states and 407 transitions. [2021-01-07 05:46:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:46:28,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2021-01-07 05:46:28,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:28,618 INFO L225 Difference]: With dead ends: 293 [2021-01-07 05:46:28,618 INFO L226 Difference]: Without dead ends: 293 [2021-01-07 05:46:28,619 INFO L677 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-01-07 05:46:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-01-07 05:46:28,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2021-01-07 05:46:28,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2021-01-07 05:46:28,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 407 transitions. [2021-01-07 05:46:28,631 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 407 transitions. Word has length 21 [2021-01-07 05:46:28,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:28,632 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 407 transitions. [2021-01-07 05:46:28,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:46:28,633 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 407 transitions. [2021-01-07 05:46:28,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-07 05:46:28,635 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:28,635 INFO L422 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] [2021-01-07 05:46:28,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 05:46:28,635 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:28,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:28,637 INFO L82 PathProgramCache]: Analyzing trace with hash 847063989, now seen corresponding path program 1 times [2021-01-07 05:46:28,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:28,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342006067] [2021-01-07 05:46:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:28,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342006067] [2021-01-07 05:46:28,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:28,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:46:28,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39042640] [2021-01-07 05:46:28,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:46:28,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:28,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:46:28,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:46:28,828 INFO L87 Difference]: Start difference. First operand 293 states and 407 transitions. Second operand 4 states. [2021-01-07 05:46:29,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:29,036 INFO L93 Difference]: Finished difference Result 310 states and 426 transitions. [2021-01-07 05:46:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:46:29,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2021-01-07 05:46:29,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:29,041 INFO L225 Difference]: With dead ends: 310 [2021-01-07 05:46:29,041 INFO L226 Difference]: Without dead ends: 309 [2021-01-07 05:46:29,042 INFO L677 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-01-07 05:46:29,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-01-07 05:46:29,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 305. [2021-01-07 05:46:29,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2021-01-07 05:46:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 422 transitions. [2021-01-07 05:46:29,051 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 422 transitions. Word has length 26 [2021-01-07 05:46:29,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:29,051 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 422 transitions. [2021-01-07 05:46:29,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:46:29,052 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 422 transitions. [2021-01-07 05:46:29,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:46:29,053 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:29,053 INFO L422 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-01-07 05:46:29,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 05:46:29,053 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:29,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:29,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1660315800, now seen corresponding path program 1 times [2021-01-07 05:46:29,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:29,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806716877] [2021-01-07 05:46:29,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:29,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806716877] [2021-01-07 05:46:29,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:29,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:46:29,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886522712] [2021-01-07 05:46:29,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:46:29,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:29,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:46:29,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:46:29,099 INFO L87 Difference]: Start difference. First operand 305 states and 422 transitions. Second operand 3 states. [2021-01-07 05:46:29,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:29,220 INFO L93 Difference]: Finished difference Result 302 states and 418 transitions. [2021-01-07 05:46:29,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:46:29,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2021-01-07 05:46:29,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:29,223 INFO L225 Difference]: With dead ends: 302 [2021-01-07 05:46:29,223 INFO L226 Difference]: Without dead ends: 302 [2021-01-07 05:46:29,223 INFO L677 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-01-07 05:46:29,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-01-07 05:46:29,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2021-01-07 05:46:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2021-01-07 05:46:29,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 418 transitions. [2021-01-07 05:46:29,232 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 418 transitions. Word has length 27 [2021-01-07 05:46:29,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:29,232 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 418 transitions. [2021-01-07 05:46:29,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:46:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 418 transitions. [2021-01-07 05:46:29,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:46:29,233 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:29,233 INFO L422 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-01-07 05:46:29,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 05:46:29,234 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:29,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:29,235 INFO L82 PathProgramCache]: Analyzing trace with hash -23036524, now seen corresponding path program 1 times [2021-01-07 05:46:29,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:29,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116421921] [2021-01-07 05:46:29,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:29,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116421921] [2021-01-07 05:46:29,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:29,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:46:29,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189697035] [2021-01-07 05:46:29,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:46:29,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:29,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:46:29,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:46:29,277 INFO L87 Difference]: Start difference. First operand 302 states and 418 transitions. Second operand 3 states. [2021-01-07 05:46:29,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:29,302 INFO L93 Difference]: Finished difference Result 315 states and 432 transitions. [2021-01-07 05:46:29,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:46:29,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2021-01-07 05:46:29,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:29,305 INFO L225 Difference]: With dead ends: 315 [2021-01-07 05:46:29,305 INFO L226 Difference]: Without dead ends: 315 [2021-01-07 05:46:29,306 INFO L677 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-01-07 05:46:29,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-01-07 05:46:29,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 302. [2021-01-07 05:46:29,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2021-01-07 05:46:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 417 transitions. [2021-01-07 05:46:29,313 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 417 transitions. Word has length 27 [2021-01-07 05:46:29,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:29,314 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 417 transitions. [2021-01-07 05:46:29,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:46:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 417 transitions. [2021-01-07 05:46:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:46:29,315 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:29,315 INFO L422 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-01-07 05:46:29,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 05:46:29,316 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:29,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:29,316 INFO L82 PathProgramCache]: Analyzing trace with hash 476963846, now seen corresponding path program 1 times [2021-01-07 05:46:29,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:29,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733888276] [2021-01-07 05:46:29,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:29,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733888276] [2021-01-07 05:46:29,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:29,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:46:29,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392250085] [2021-01-07 05:46:29,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:46:29,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:29,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:46:29,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:46:29,398 INFO L87 Difference]: Start difference. First operand 302 states and 417 transitions. Second operand 4 states. [2021-01-07 05:46:29,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:29,587 INFO L93 Difference]: Finished difference Result 306 states and 419 transitions. [2021-01-07 05:46:29,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:46:29,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2021-01-07 05:46:29,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:29,595 INFO L225 Difference]: With dead ends: 306 [2021-01-07 05:46:29,597 INFO L226 Difference]: Without dead ends: 306 [2021-01-07 05:46:29,598 INFO L677 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-01-07 05:46:29,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-01-07 05:46:29,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2021-01-07 05:46:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2021-01-07 05:46:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 416 transitions. [2021-01-07 05:46:29,607 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 416 transitions. Word has length 27 [2021-01-07 05:46:29,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:29,608 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 416 transitions. [2021-01-07 05:46:29,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:46:29,608 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 416 transitions. [2021-01-07 05:46:29,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 05:46:29,613 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:29,613 INFO L422 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] [2021-01-07 05:46:29,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 05:46:29,614 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:29,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:29,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1894183263, now seen corresponding path program 1 times [2021-01-07 05:46:29,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:29,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623615754] [2021-01-07 05:46:29,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:29,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:29,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623615754] [2021-01-07 05:46:29,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:29,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:46:29,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414282553] [2021-01-07 05:46:29,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:46:29,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:29,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:46:29,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:46:29,690 INFO L87 Difference]: Start difference. First operand 302 states and 416 transitions. Second operand 3 states. [2021-01-07 05:46:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:29,711 INFO L93 Difference]: Finished difference Result 295 states and 404 transitions. [2021-01-07 05:46:29,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:46:29,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2021-01-07 05:46:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:29,714 INFO L225 Difference]: With dead ends: 295 [2021-01-07 05:46:29,714 INFO L226 Difference]: Without dead ends: 273 [2021-01-07 05:46:29,715 INFO L677 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-01-07 05:46:29,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-01-07 05:46:29,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 249. [2021-01-07 05:46:29,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2021-01-07 05:46:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 347 transitions. [2021-01-07 05:46:29,723 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 347 transitions. Word has length 28 [2021-01-07 05:46:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:29,723 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 347 transitions. [2021-01-07 05:46:29,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:46:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 347 transitions. [2021-01-07 05:46:29,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-07 05:46:29,724 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:29,724 INFO L422 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] [2021-01-07 05:46:29,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 05:46:29,725 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:29,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:29,726 INFO L82 PathProgramCache]: Analyzing trace with hash 403678015, now seen corresponding path program 1 times [2021-01-07 05:46:29,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:29,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239494317] [2021-01-07 05:46:29,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:29,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239494317] [2021-01-07 05:46:29,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:29,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:46:29,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566134339] [2021-01-07 05:46:29,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:46:29,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:29,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:46:29,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:46:29,835 INFO L87 Difference]: Start difference. First operand 249 states and 347 transitions. Second operand 5 states. [2021-01-07 05:46:30,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:30,139 INFO L93 Difference]: Finished difference Result 359 states and 474 transitions. [2021-01-07 05:46:30,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:46:30,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2021-01-07 05:46:30,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:30,143 INFO L225 Difference]: With dead ends: 359 [2021-01-07 05:46:30,144 INFO L226 Difference]: Without dead ends: 359 [2021-01-07 05:46:30,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:46:30,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-01-07 05:46:30,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 284. [2021-01-07 05:46:30,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2021-01-07 05:46:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 399 transitions. [2021-01-07 05:46:30,154 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 399 transitions. Word has length 30 [2021-01-07 05:46:30,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:30,154 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 399 transitions. [2021-01-07 05:46:30,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:46:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 399 transitions. [2021-01-07 05:46:30,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-07 05:46:30,161 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:30,162 INFO L422 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] [2021-01-07 05:46:30,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 05:46:30,162 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:30,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:30,163 INFO L82 PathProgramCache]: Analyzing trace with hash 361661719, now seen corresponding path program 1 times [2021-01-07 05:46:30,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:30,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754797737] [2021-01-07 05:46:30,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:30,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754797737] [2021-01-07 05:46:30,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:30,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:46:30,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218816036] [2021-01-07 05:46:30,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:46:30,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:30,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:46:30,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:46:30,260 INFO L87 Difference]: Start difference. First operand 284 states and 399 transitions. Second operand 5 states. [2021-01-07 05:46:30,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:30,500 INFO L93 Difference]: Finished difference Result 320 states and 430 transitions. [2021-01-07 05:46:30,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:46:30,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2021-01-07 05:46:30,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:30,502 INFO L225 Difference]: With dead ends: 320 [2021-01-07 05:46:30,502 INFO L226 Difference]: Without dead ends: 315 [2021-01-07 05:46:30,503 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-07 05:46:30,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-01-07 05:46:30,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 271. [2021-01-07 05:46:30,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2021-01-07 05:46:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 381 transitions. [2021-01-07 05:46:30,510 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 381 transitions. Word has length 30 [2021-01-07 05:46:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:30,510 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 381 transitions. [2021-01-07 05:46:30,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:46:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 381 transitions. [2021-01-07 05:46:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-07 05:46:30,512 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:30,512 INFO L422 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-01-07 05:46:30,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 05:46:30,513 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:30,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:30,513 INFO L82 PathProgramCache]: Analyzing trace with hash -959450186, now seen corresponding path program 1 times [2021-01-07 05:46:30,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:30,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439007352] [2021-01-07 05:46:30,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:30,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439007352] [2021-01-07 05:46:30,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:30,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:46:30,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278844203] [2021-01-07 05:46:30,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:46:30,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:30,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:46:30,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:46:30,589 INFO L87 Difference]: Start difference. First operand 271 states and 381 transitions. Second operand 4 states. [2021-01-07 05:46:30,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:30,760 INFO L93 Difference]: Finished difference Result 271 states and 368 transitions. [2021-01-07 05:46:30,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:46:30,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2021-01-07 05:46:30,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:30,763 INFO L225 Difference]: With dead ends: 271 [2021-01-07 05:46:30,763 INFO L226 Difference]: Without dead ends: 271 [2021-01-07 05:46:30,764 INFO L677 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-01-07 05:46:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-01-07 05:46:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2021-01-07 05:46:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2021-01-07 05:46:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 368 transitions. [2021-01-07 05:46:30,772 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 368 transitions. Word has length 31 [2021-01-07 05:46:30,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:30,772 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 368 transitions. [2021-01-07 05:46:30,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:46:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 368 transitions. [2021-01-07 05:46:30,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-07 05:46:30,774 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:30,774 INFO L422 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-01-07 05:46:30,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 05:46:30,774 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:30,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:30,775 INFO L82 PathProgramCache]: Analyzing trace with hash -378484437, now seen corresponding path program 1 times [2021-01-07 05:46:30,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:30,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135127927] [2021-01-07 05:46:30,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:30,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:30,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135127927] [2021-01-07 05:46:30,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:30,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:46:30,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198357714] [2021-01-07 05:46:30,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:46:30,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:30,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:46:30,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:46:30,822 INFO L87 Difference]: Start difference. First operand 271 states and 368 transitions. Second operand 3 states. [2021-01-07 05:46:30,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:30,856 INFO L93 Difference]: Finished difference Result 495 states and 678 transitions. [2021-01-07 05:46:30,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:46:30,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2021-01-07 05:46:30,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:30,859 INFO L225 Difference]: With dead ends: 495 [2021-01-07 05:46:30,860 INFO L226 Difference]: Without dead ends: 495 [2021-01-07 05:46:30,860 INFO L677 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-01-07 05:46:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2021-01-07 05:46:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 321. [2021-01-07 05:46:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2021-01-07 05:46:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 434 transitions. [2021-01-07 05:46:30,870 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 434 transitions. Word has length 31 [2021-01-07 05:46:30,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:30,871 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 434 transitions. [2021-01-07 05:46:30,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:46:30,871 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 434 transitions. [2021-01-07 05:46:30,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-07 05:46:30,873 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:30,873 INFO L422 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-01-07 05:46:30,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 05:46:30,873 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:30,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:30,874 INFO L82 PathProgramCache]: Analyzing trace with hash -378424855, now seen corresponding path program 1 times [2021-01-07 05:46:30,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:30,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228052781] [2021-01-07 05:46:30,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:30,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228052781] [2021-01-07 05:46:30,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:30,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:46:30,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936532473] [2021-01-07 05:46:30,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:46:30,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:30,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:46:30,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:46:30,944 INFO L87 Difference]: Start difference. First operand 321 states and 434 transitions. Second operand 4 states. [2021-01-07 05:46:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:30,989 INFO L93 Difference]: Finished difference Result 309 states and 416 transitions. [2021-01-07 05:46:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:46:30,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2021-01-07 05:46:30,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:30,992 INFO L225 Difference]: With dead ends: 309 [2021-01-07 05:46:30,993 INFO L226 Difference]: Without dead ends: 309 [2021-01-07 05:46:30,995 INFO L677 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-01-07 05:46:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-01-07 05:46:31,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2021-01-07 05:46:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2021-01-07 05:46:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 416 transitions. [2021-01-07 05:46:31,008 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 416 transitions. Word has length 31 [2021-01-07 05:46:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:31,008 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 416 transitions. [2021-01-07 05:46:31,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:46:31,008 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 416 transitions. [2021-01-07 05:46:31,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-07 05:46:31,010 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:31,010 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:46:31,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 05:46:31,011 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:31,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:31,013 INFO L82 PathProgramCache]: Analyzing trace with hash -329006014, now seen corresponding path program 1 times [2021-01-07 05:46:31,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:31,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903445354] [2021-01-07 05:46:31,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46: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-01-07 05:46:31,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903445354] [2021-01-07 05:46:31,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:31,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:46:31,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047788812] [2021-01-07 05:46:31,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:46:31,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:31,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:46:31,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:46:31,080 INFO L87 Difference]: Start difference. First operand 309 states and 416 transitions. Second operand 4 states. [2021-01-07 05:46:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:31,233 INFO L93 Difference]: Finished difference Result 301 states and 404 transitions. [2021-01-07 05:46:31,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:46:31,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2021-01-07 05:46:31,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:31,236 INFO L225 Difference]: With dead ends: 301 [2021-01-07 05:46:31,236 INFO L226 Difference]: Without dead ends: 297 [2021-01-07 05:46:31,237 INFO L677 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-01-07 05:46:31,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-01-07 05:46:31,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2021-01-07 05:46:31,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2021-01-07 05:46:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 400 transitions. [2021-01-07 05:46:31,245 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 400 transitions. Word has length 32 [2021-01-07 05:46:31,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:31,245 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 400 transitions. [2021-01-07 05:46:31,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:46:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 400 transitions. [2021-01-07 05:46:31,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-07 05:46:31,247 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:31,247 INFO L422 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-01-07 05:46:31,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 05:46:31,247 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:31,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:31,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2012498225, now seen corresponding path program 1 times [2021-01-07 05:46:31,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:31,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924954554] [2021-01-07 05:46:31,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:31,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:31,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924954554] [2021-01-07 05:46:31,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:31,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:46:31,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735662740] [2021-01-07 05:46:31,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:46:31,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:31,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:46:31,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:46:31,370 INFO L87 Difference]: Start difference. First operand 297 states and 400 transitions. Second operand 7 states. [2021-01-07 05:46:31,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:31,710 INFO L93 Difference]: Finished difference Result 328 states and 431 transitions. [2021-01-07 05:46:31,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:46:31,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2021-01-07 05:46:31,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:31,713 INFO L225 Difference]: With dead ends: 328 [2021-01-07 05:46:31,714 INFO L226 Difference]: Without dead ends: 267 [2021-01-07 05:46:31,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:46:31,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-01-07 05:46:31,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 245. [2021-01-07 05:46:31,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2021-01-07 05:46:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 328 transitions. [2021-01-07 05:46:31,725 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 328 transitions. Word has length 33 [2021-01-07 05:46:31,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:31,726 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 328 transitions. [2021-01-07 05:46:31,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:46:31,726 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 328 transitions. [2021-01-07 05:46:31,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-07 05:46:31,727 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:31,727 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:46:31,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 05:46:31,727 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:31,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:31,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1781478438, now seen corresponding path program 1 times [2021-01-07 05:46:31,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:31,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99737607] [2021-01-07 05:46:31,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:31,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:31,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99737607] [2021-01-07 05:46:31,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:31,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:46:31,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376270747] [2021-01-07 05:46:31,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:46:31,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:31,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:46:31,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:46:31,789 INFO L87 Difference]: Start difference. First operand 245 states and 328 transitions. Second operand 3 states. [2021-01-07 05:46:31,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:31,881 INFO L93 Difference]: Finished difference Result 299 states and 386 transitions. [2021-01-07 05:46:31,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:46:31,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2021-01-07 05:46:31,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:31,884 INFO L225 Difference]: With dead ends: 299 [2021-01-07 05:46:31,885 INFO L226 Difference]: Without dead ends: 299 [2021-01-07 05:46:31,885 INFO L677 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-01-07 05:46:31,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-01-07 05:46:31,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 247. [2021-01-07 05:46:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2021-01-07 05:46:31,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 330 transitions. [2021-01-07 05:46:31,893 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 330 transitions. Word has length 34 [2021-01-07 05:46:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:31,894 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 330 transitions. [2021-01-07 05:46:31,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:46:31,894 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 330 transitions. [2021-01-07 05:46:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-07 05:46:31,895 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:31,895 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:46:31,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 05:46:31,896 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:31,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:31,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1662125936, now seen corresponding path program 1 times [2021-01-07 05:46:31,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:31,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027403007] [2021-01-07 05:46:31,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:31,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027403007] [2021-01-07 05:46:31,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:31,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:46:31,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790036010] [2021-01-07 05:46:31,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:46:31,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:31,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:46:31,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:46:31,955 INFO L87 Difference]: Start difference. First operand 247 states and 330 transitions. Second operand 3 states. [2021-01-07 05:46:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:32,041 INFO L93 Difference]: Finished difference Result 261 states and 345 transitions. [2021-01-07 05:46:32,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:46:32,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2021-01-07 05:46:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:32,043 INFO L225 Difference]: With dead ends: 261 [2021-01-07 05:46:32,043 INFO L226 Difference]: Without dead ends: 259 [2021-01-07 05:46:32,044 INFO L677 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-01-07 05:46:32,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-01-07 05:46:32,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 251. [2021-01-07 05:46:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2021-01-07 05:46:32,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 333 transitions. [2021-01-07 05:46:32,050 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 333 transitions. Word has length 34 [2021-01-07 05:46:32,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:32,051 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 333 transitions. [2021-01-07 05:46:32,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:46:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 333 transitions. [2021-01-07 05:46:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-07 05:46:32,052 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:32,052 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:46:32,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 05:46:32,053 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:32,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:32,053 INFO L82 PathProgramCache]: Analyzing trace with hash -822248422, now seen corresponding path program 1 times [2021-01-07 05:46:32,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:32,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335389782] [2021-01-07 05:46:32,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:32,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:32,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335389782] [2021-01-07 05:46:32,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:32,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:46:32,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18356656] [2021-01-07 05:46:32,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:46:32,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:32,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:46:32,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:46:32,114 INFO L87 Difference]: Start difference. First operand 251 states and 333 transitions. Second operand 5 states. [2021-01-07 05:46:32,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:32,277 INFO L93 Difference]: Finished difference Result 300 states and 379 transitions. [2021-01-07 05:46:32,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:46:32,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2021-01-07 05:46:32,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:32,279 INFO L225 Difference]: With dead ends: 300 [2021-01-07 05:46:32,279 INFO L226 Difference]: Without dead ends: 300 [2021-01-07 05:46:32,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-07 05:46:32,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-01-07 05:46:32,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 251. [2021-01-07 05:46:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2021-01-07 05:46:32,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 331 transitions. [2021-01-07 05:46:32,289 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 331 transitions. Word has length 34 [2021-01-07 05:46:32,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:32,290 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 331 transitions. [2021-01-07 05:46:32,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:46:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 331 transitions. [2021-01-07 05:46:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-07 05:46:32,291 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:32,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:46:32,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 05:46:32,292 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:32,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:32,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1935189253, now seen corresponding path program 1 times [2021-01-07 05:46:32,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:32,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875216470] [2021-01-07 05:46:32,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:32,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-01-07 05:46:32,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875216470] [2021-01-07 05:46:32,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:32,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:46:32,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314979754] [2021-01-07 05:46:32,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:46:32,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:32,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:46:32,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:46:32,459 INFO L87 Difference]: Start difference. First operand 251 states and 331 transitions. Second operand 7 states. [2021-01-07 05:46:32,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:32,698 INFO L93 Difference]: Finished difference Result 267 states and 349 transitions. [2021-01-07 05:46:32,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:46:32,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2021-01-07 05:46:32,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:32,701 INFO L225 Difference]: With dead ends: 267 [2021-01-07 05:46:32,701 INFO L226 Difference]: Without dead ends: 250 [2021-01-07 05:46:32,702 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:46:32,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-01-07 05:46:32,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2021-01-07 05:46:32,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2021-01-07 05:46:32,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 329 transitions. [2021-01-07 05:46:32,708 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 329 transitions. Word has length 34 [2021-01-07 05:46:32,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:32,708 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 329 transitions. [2021-01-07 05:46:32,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:46:32,708 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 329 transitions. [2021-01-07 05:46:32,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-07 05:46:32,709 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:32,710 INFO L422 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-01-07 05:46:32,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-07 05:46:32,710 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:32,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:32,711 INFO L82 PathProgramCache]: Analyzing trace with hash -21362253, now seen corresponding path program 1 times [2021-01-07 05:46:32,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:32,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413019336] [2021-01-07 05:46:32,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:32,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413019336] [2021-01-07 05:46:32,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:32,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:46:32,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464380335] [2021-01-07 05:46:32,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:46:32,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:32,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:46:32,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:46:32,797 INFO L87 Difference]: Start difference. First operand 250 states and 329 transitions. Second operand 4 states. [2021-01-07 05:46:32,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:32,926 INFO L93 Difference]: Finished difference Result 273 states and 351 transitions. [2021-01-07 05:46:32,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:46:32,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2021-01-07 05:46:32,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:32,928 INFO L225 Difference]: With dead ends: 273 [2021-01-07 05:46:32,928 INFO L226 Difference]: Without dead ends: 265 [2021-01-07 05:46:32,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:46:32,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-01-07 05:46:32,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 239. [2021-01-07 05:46:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-07 05:46:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 314 transitions. [2021-01-07 05:46:32,935 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 314 transitions. Word has length 35 [2021-01-07 05:46:32,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:32,936 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 314 transitions. [2021-01-07 05:46:32,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:46:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 314 transitions. [2021-01-07 05:46:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-07 05:46:32,937 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:32,938 INFO L422 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-01-07 05:46:32,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-07 05:46:32,938 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:32,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:32,939 INFO L82 PathProgramCache]: Analyzing trace with hash 272561262, now seen corresponding path program 1 times [2021-01-07 05:46:32,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:32,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535231841] [2021-01-07 05:46:32,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:33,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:33,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535231841] [2021-01-07 05:46:33,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:33,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:46:33,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212497652] [2021-01-07 05:46:33,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:46:33,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:33,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:46:33,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:46:33,004 INFO L87 Difference]: Start difference. First operand 239 states and 314 transitions. Second operand 5 states. [2021-01-07 05:46:33,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:33,145 INFO L93 Difference]: Finished difference Result 266 states and 335 transitions. [2021-01-07 05:46:33,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:46:33,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2021-01-07 05:46:33,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:33,147 INFO L225 Difference]: With dead ends: 266 [2021-01-07 05:46:33,147 INFO L226 Difference]: Without dead ends: 266 [2021-01-07 05:46:33,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-07 05:46:33,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-01-07 05:46:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 239. [2021-01-07 05:46:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-07 05:46:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 308 transitions. [2021-01-07 05:46:33,154 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 308 transitions. Word has length 35 [2021-01-07 05:46:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:33,154 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 308 transitions. [2021-01-07 05:46:33,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:46:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 308 transitions. [2021-01-07 05:46:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-07 05:46:33,155 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:33,156 INFO L422 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-01-07 05:46:33,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-07 05:46:33,156 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:33,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:33,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1030061199, now seen corresponding path program 1 times [2021-01-07 05:46:33,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:33,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427200103] [2021-01-07 05:46:33,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:33,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427200103] [2021-01-07 05:46:33,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:33,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:46:33,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579336096] [2021-01-07 05:46:33,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:46:33,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:33,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:46:33,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:46:33,192 INFO L87 Difference]: Start difference. First operand 239 states and 308 transitions. Second operand 3 states. [2021-01-07 05:46:33,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:33,204 INFO L93 Difference]: Finished difference Result 233 states and 299 transitions. [2021-01-07 05:46:33,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:46:33,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2021-01-07 05:46:33,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:33,206 INFO L225 Difference]: With dead ends: 233 [2021-01-07 05:46:33,206 INFO L226 Difference]: Without dead ends: 231 [2021-01-07 05:46:33,206 INFO L677 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-01-07 05:46:33,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-01-07 05:46:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2021-01-07 05:46:33,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2021-01-07 05:46:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 297 transitions. [2021-01-07 05:46:33,212 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 297 transitions. Word has length 35 [2021-01-07 05:46:33,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:33,213 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 297 transitions. [2021-01-07 05:46:33,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:46:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 297 transitions. [2021-01-07 05:46:33,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-07 05:46:33,214 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:33,214 INFO L422 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-01-07 05:46:33,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-07 05:46:33,215 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:33,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:33,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2102888975, now seen corresponding path program 1 times [2021-01-07 05:46:33,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:33,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038023484] [2021-01-07 05:46:33,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:33,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038023484] [2021-01-07 05:46:33,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:33,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:46:33,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723230195] [2021-01-07 05:46:33,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:46:33,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:33,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:46:33,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:46:33,278 INFO L87 Difference]: Start difference. First operand 231 states and 297 transitions. Second operand 4 states. [2021-01-07 05:46:33,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:33,387 INFO L93 Difference]: Finished difference Result 257 states and 322 transitions. [2021-01-07 05:46:33,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:46:33,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2021-01-07 05:46:33,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:33,389 INFO L225 Difference]: With dead ends: 257 [2021-01-07 05:46:33,389 INFO L226 Difference]: Without dead ends: 257 [2021-01-07 05:46:33,390 INFO L677 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-01-07 05:46:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-01-07 05:46:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 251. [2021-01-07 05:46:33,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2021-01-07 05:46:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 317 transitions. [2021-01-07 05:46:33,396 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 317 transitions. Word has length 35 [2021-01-07 05:46:33,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:33,396 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 317 transitions. [2021-01-07 05:46:33,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:46:33,396 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 317 transitions. [2021-01-07 05:46:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-07 05:46:33,397 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:33,397 INFO L422 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-01-07 05:46:33,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-07 05:46:33,398 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:33,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:33,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1665760845, now seen corresponding path program 1 times [2021-01-07 05:46:33,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:33,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695086440] [2021-01-07 05:46:33,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:33,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:33,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695086440] [2021-01-07 05:46:33,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:33,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:46:33,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068913453] [2021-01-07 05:46:33,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:46:33,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:33,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:46:33,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:46:33,455 INFO L87 Difference]: Start difference. First operand 251 states and 317 transitions. Second operand 7 states. [2021-01-07 05:46:33,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:33,667 INFO L93 Difference]: Finished difference Result 285 states and 351 transitions. [2021-01-07 05:46:33,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:46:33,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2021-01-07 05:46:33,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:33,669 INFO L225 Difference]: With dead ends: 285 [2021-01-07 05:46:33,670 INFO L226 Difference]: Without dead ends: 208 [2021-01-07 05:46:33,670 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:46:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-01-07 05:46:33,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 192. [2021-01-07 05:46:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2021-01-07 05:46:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 230 transitions. [2021-01-07 05:46:33,676 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 230 transitions. Word has length 35 [2021-01-07 05:46:33,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:33,676 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 230 transitions. [2021-01-07 05:46:33,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:46:33,676 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 230 transitions. [2021-01-07 05:46:33,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-07 05:46:33,693 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:33,693 INFO L422 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-01-07 05:46:33,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-07 05:46:33,694 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:33,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:33,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1804254012, now seen corresponding path program 1 times [2021-01-07 05:46:33,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:33,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652166496] [2021-01-07 05:46:33,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:33,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:33,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652166496] [2021-01-07 05:46:33,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:33,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 05:46:33,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105960470] [2021-01-07 05:46:33,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:46:33,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:33,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:46:33,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:46:33,768 INFO L87 Difference]: Start difference. First operand 192 states and 230 transitions. Second operand 6 states. [2021-01-07 05:46:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:33,904 INFO L93 Difference]: Finished difference Result 206 states and 244 transitions. [2021-01-07 05:46:33,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:46:33,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2021-01-07 05:46:33,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:33,906 INFO L225 Difference]: With dead ends: 206 [2021-01-07 05:46:33,906 INFO L226 Difference]: Without dead ends: 168 [2021-01-07 05:46:33,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:46:33,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-01-07 05:46:33,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2021-01-07 05:46:33,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-07 05:46:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 197 transitions. [2021-01-07 05:46:33,912 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 197 transitions. Word has length 35 [2021-01-07 05:46:33,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:33,912 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 197 transitions. [2021-01-07 05:46:33,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:46:33,912 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 197 transitions. [2021-01-07 05:46:33,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 05:46:33,913 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:33,913 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:46:33,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-07 05:46:33,913 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:33,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:33,914 INFO L82 PathProgramCache]: Analyzing trace with hash -961302835, now seen corresponding path program 1 times [2021-01-07 05:46:33,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:33,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288537996] [2021-01-07 05:46:33,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:46:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:46:33,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288537996] [2021-01-07 05:46:33,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:46:33,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:46:33,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284434063] [2021-01-07 05:46:33,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:46:33,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:46:33,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:46:33,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:46:33,973 INFO L87 Difference]: Start difference. First operand 168 states and 197 transitions. Second operand 7 states. [2021-01-07 05:46:34,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:46:34,146 INFO L93 Difference]: Finished difference Result 222 states and 253 transitions. [2021-01-07 05:46:34,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:46:34,146 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2021-01-07 05:46:34,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:46:34,147 INFO L225 Difference]: With dead ends: 222 [2021-01-07 05:46:34,148 INFO L226 Difference]: Without dead ends: 195 [2021-01-07 05:46:34,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:46:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-01-07 05:46:34,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 167. [2021-01-07 05:46:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2021-01-07 05:46:34,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2021-01-07 05:46:34,154 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 36 [2021-01-07 05:46:34,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:46:34,154 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2021-01-07 05:46:34,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:46:34,154 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2021-01-07 05:46:34,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-07 05:46:34,155 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:46:34,155 INFO L422 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-01-07 05:46:34,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-07 05:46:34,156 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2021-01-07 05:46:34,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:46:34,156 INFO L82 PathProgramCache]: Analyzing trace with hash 724480386, now seen corresponding path program 1 times [2021-01-07 05:46:34,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:46:34,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041378918] [2021-01-07 05:46:34,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:46:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-07 05:46:34,173 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-07 05:46:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-07 05:46:34,190 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-07 05:46:34,233 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-07 05:46:34,234 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-07 05:46:34,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-07 05:46:34,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 05:46:34 BoogieIcfgContainer [2021-01-07 05:46:34,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-07 05:46:34,351 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-07 05:46:34,351 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-07 05:46:34,354 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-07 05:46:34,355 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:46:26" (3/4) ... [2021-01-07 05:46:34,361 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-01-07 05:46:34,361 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-07 05:46:34,363 INFO L168 Benchmark]: Toolchain (without parser) took 11078.43 ms. Allocated memory was 164.6 MB in the beginning and 278.9 MB in the end (delta: 114.3 MB). Free memory was 139.6 MB in the beginning and 170.2 MB in the end (delta: -30.6 MB). Peak memory consumption was 84.2 MB. Max. memory is 8.0 GB. [2021-01-07 05:46:34,363 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 164.6 MB. Free memory was 136.5 MB in the beginning and 136.4 MB in the end (delta: 91.0 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-07 05:46:34,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.11 ms. Allocated memory is still 164.6 MB. Free memory was 139.4 MB in the beginning and 120.3 MB in the end (delta: 19.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2021-01-07 05:46:34,364 INFO L168 Benchmark]: Boogie Procedure Inliner took 144.62 ms. Allocated memory is still 164.6 MB. Free memory was 120.2 MB in the beginning and 114.0 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2021-01-07 05:46:34,365 INFO L168 Benchmark]: Boogie Preprocessor took 151.65 ms. Allocated memory is still 164.6 MB. Free memory was 114.0 MB in the beginning and 144.0 MB in the end (delta: -30.0 MB). Peak memory consumption was 8.2 MB. Max. memory is 8.0 GB. [2021-01-07 05:46:34,366 INFO L168 Benchmark]: RCFGBuilder took 2270.06 ms. Allocated memory was 164.6 MB in the beginning and 205.5 MB in the end (delta: 40.9 MB). Free memory was 144.0 MB in the beginning and 166.6 MB in the end (delta: -22.6 MB). Peak memory consumption was 95.4 MB. Max. memory is 8.0 GB. [2021-01-07 05:46:34,366 INFO L168 Benchmark]: TraceAbstraction took 7816.00 ms. Allocated memory was 205.5 MB in the beginning and 278.9 MB in the end (delta: 73.4 MB). Free memory was 166.1 MB in the beginning and 170.8 MB in the end (delta: -4.7 MB). Peak memory consumption was 69.3 MB. Max. memory is 8.0 GB. [2021-01-07 05:46:34,367 INFO L168 Benchmark]: Witness Printer took 9.93 ms. Allocated memory is still 278.9 MB. Free memory was 170.8 MB in the beginning and 170.2 MB in the end (delta: 522.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-07 05:46:34,370 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 164.6 MB. Free memory was 136.5 MB in the beginning and 136.4 MB in the end (delta: 91.0 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 672.11 ms. Allocated memory is still 164.6 MB. Free memory was 139.4 MB in the beginning and 120.3 MB in the end (delta: 19.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 144.62 ms. Allocated memory is still 164.6 MB. Free memory was 120.2 MB in the beginning and 114.0 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 151.65 ms. Allocated memory is still 164.6 MB. Free memory was 114.0 MB in the beginning and 144.0 MB in the end (delta: -30.0 MB). Peak memory consumption was 8.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2270.06 ms. Allocated memory was 164.6 MB in the beginning and 205.5 MB in the end (delta: 40.9 MB). Free memory was 144.0 MB in the beginning and 166.6 MB in the end (delta: -22.6 MB). Peak memory consumption was 95.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7816.00 ms. Allocated memory was 205.5 MB in the beginning and 278.9 MB in the end (delta: 73.4 MB). Free memory was 166.1 MB in the beginning and 170.8 MB in the end (delta: -4.7 MB). Peak memory consumption was 69.3 MB. Max. memory is 8.0 GB. * Witness Printer took 9.93 ms. Allocated memory is still 278.9 MB. Free memory was 170.8 MB in the beginning and 170.2 MB in the end (delta: 522.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1013]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1013. Possible FailurePath: [L23] int KernelMode ; [L24] int Executive ; [L25] int DevicePowerState ; [L26] int s ; [L27] int UNLOADED ; [L28] int NP ; [L29] int DC ; [L30] int SKIP1 ; [L31] int SKIP2 ; [L32] int MPR1 ; [L33] int MPR3 ; [L34] int IPC ; [L35] int pended ; [L36] int compFptr ; [L37] int compRegistered ; [L38] int lowerDriverReturn ; [L39] int setEventCalled ; [L40] int customIrp ; [L41] int myStatus ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L294] int status ; [L295] int irp = __VERIFIER_nondet_int() ; [L296] int pirp ; [L297] int pirp__IoStatus__Status ; [L298] int irp_choice = __VERIFIER_nondet_int() ; [L299] int devobj = __VERIFIER_nondet_int() ; [L300] int __cil_tmp8 ; [L302] KernelMode = 0 [L303] Executive = 0 [L304] DevicePowerState = 1 [L305] s = 0 [L306] UNLOADED = 0 [L307] NP = 0 [L308] DC = 0 [L309] SKIP1 = 0 [L310] SKIP2 = 0 [L311] MPR1 = 0 [L312] MPR3 = 0 [L313] IPC = 0 [L314] pended = 0 [L315] compFptr = 0 [L316] compRegistered = 0 [L317] lowerDriverReturn = 0 [L318] setEventCalled = 0 [L319] customIrp = 0 [L320] myStatus = 0 [L324] status = 0 [L325] pirp = irp [L61] UNLOADED = 0 [L62] NP = 1 [L63] DC = 2 [L64] SKIP1 = 3 [L65] SKIP2 = 4 [L66] MPR1 = 5 [L67] MPR3 = 6 [L68] IPC = 7 [L69] s = UNLOADED [L70] pended = 0 [L71] compFptr = 0 [L72] compRegistered = 0 [L73] lowerDriverReturn = 0 [L74] setEventCalled = 0 [L75] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L328] COND TRUE status >= 0 [L329] s = NP [L330] customIrp = 0 [L331] setEventCalled = customIrp [L332] lowerDriverReturn = setEventCalled [L333] compRegistered = lowerDriverReturn [L334] pended = compRegistered [L335] pirp__IoStatus__Status = 0 [L336] myStatus = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L337] COND TRUE irp_choice == 0 [L338] pirp__IoStatus__Status = -1073741637 [L339] myStatus = -1073741637 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L47] s = NP [L48] pended = 0 [L49] compFptr = 0 [L50] compRegistered = 0 [L51] lowerDriverReturn = 0 [L52] setEventCalled = 0 [L53] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L345] COND FALSE !(status < 0) [L349] int tmp_ndt_1; [L350] tmp_ndt_1 = __VERIFIER_nondet_int() [L351] COND FALSE !(tmp_ndt_1 == 0) [L354] int tmp_ndt_2; [L355] tmp_ndt_2 = __VERIFIER_nondet_int() [L356] COND FALSE !(tmp_ndt_2 == 1) [L359] int tmp_ndt_3; [L360] tmp_ndt_3 = __VERIFIER_nondet_int() [L361] COND TRUE tmp_ndt_3 == 3 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L80] int devExt ; [L81] int irpStack ; [L82] int status ; [L83] int event = __VERIFIER_nondet_int() ; [L84] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L85] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L86] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L87] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L88] int devExt__Started ; [L89] int devExt__Removed ; [L90] int devExt__SurpriseRemoved ; [L91] int Irp__IoStatus__Status ; [L92] int Irp__IoStatus__Information ; [L93] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L94] int irpSp ; [L95] int nextIrpSp ; [L96] int nextIrpSp__Control ; [L97] int irpSp___0 ; [L98] int irpSp__Context ; [L99] int irpSp__Control ; [L100] long __cil_tmp23 ; [L103] status = 0 [L104] devExt = DeviceObject__DeviceExtension [L105] irpStack = Irp__Tail__Overlay__CurrentStackLocation VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L106] COND FALSE !(irpStack__MinorFunction == 0) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L109] COND FALSE !(irpStack__MinorFunction == 23) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L112] COND TRUE irpStack__MinorFunction == 2 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L236] devExt__Removed = 1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L237] COND TRUE s == NP [L238] s = SKIP1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L245] Irp__CurrentLocation ++ [L246] Irp__Tail__Overlay__CurrentStackLocation ++ [L483] int returnVal2 ; [L484] int compRetStatus ; [L485] int lcontext = __VERIFIER_nondet_int() ; [L486] long long __cil_tmp7 ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L489] COND FALSE !(\read(compRegistered)) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L502] int tmp_ndt_6; [L503] tmp_ndt_6 = __VERIFIER_nondet_int() [L504] COND FALSE !(tmp_ndt_6 == 0) [L507] int tmp_ndt_7; [L508] tmp_ndt_7 = __VERIFIER_nondet_int() [L509] COND TRUE tmp_ndt_7 == 1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L518] returnVal2 = -1073741823 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L528] COND FALSE !(s == NP) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L532] COND FALSE !(s == MPR1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L541] COND TRUE s == SKIP1 [L542] s = SKIP2 [L543] lowerDriverReturn = returnVal2 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L551] return (returnVal2); VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L248] status = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L290] return (status); VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L388] status = KbFilter_PnP(devobj, pirp) [L412] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L420] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L428] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L429] COND TRUE status != -1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L430] COND FALSE !(s != SKIP2) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L440] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L447] COND FALSE !(s == DC) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L452] COND TRUE status != lowerDriverReturn VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L1013] reach_error() VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 331 locations, 31 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.5s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8410 SDtfs, 6052 SDslu, 10700 SDs, 0 SdLazy, 2225 SolverSat, 317 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=357occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 650 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 841 NumberOfCodeBlocks, 841 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 776 ConstructedInterpolants, 0 QuantifiedInterpolants, 70515 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...