/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-Reach-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-06 11:34:39,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:34:39,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:34:39,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:34:39,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:34:39,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:34:39,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:34:39,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:34:39,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:34:39,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:34:39,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:34:39,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:34:39,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:34:39,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:34:39,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:34:39,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:34:39,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:34:39,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:34:39,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:34:39,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:34:39,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:34:39,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:34:39,937 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:34:39,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:34:39,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:34:39,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:34:39,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:34:39,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:34:39,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:34:39,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:34:39,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:34:39,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:34:39,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:34:39,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:34:39,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:34:39,955 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:34:39,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:34:39,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:34:39,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:34:39,957 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:34:39,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:34:39,963 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:34:40,014 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:34:40,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:34:40,017 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:34:40,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:34:40,019 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:34:40,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:34:40,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:34:40,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:34:40,020 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:34:40,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:34:40,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:34:40,021 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:34:40,022 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:34:40,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:34:40,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:34:40,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:34:40,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:34:40,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:34:40,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:34:40,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:34:40,024 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:34:40,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:34:40,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:34:40,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:34:40,025 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:34:40,025 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-06 11:34:40,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:34:40,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:34:40,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:34:40,506 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:34:40,509 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:34:40,510 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-06 11:34:40,598 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d66bf7fca/bc9c0b4835df44f7be5b90786dad20d4/FLAG9f9366bf8 [2021-01-06 11:34:41,228 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:34:41,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2021-01-06 11:34:41,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d66bf7fca/bc9c0b4835df44f7be5b90786dad20d4/FLAG9f9366bf8 [2021-01-06 11:34:41,578 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d66bf7fca/bc9c0b4835df44f7be5b90786dad20d4 [2021-01-06 11:34:41,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:34:41,585 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:34:41,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:34:41,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:34:41,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:34:41,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:34:41" (1/1) ... [2021-01-06 11:34:41,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1868fc50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:34:41, skipping insertion in model container [2021-01-06 11:34:41,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:34:41" (1/1) ... [2021-01-06 11:34:41,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:34:41,686 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-06 11:34:41,980 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-06 11:34:41,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:34:41,999 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-06 11:34:42,091 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-06 11:34:42,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:34:42,118 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:34:42,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:34:42 WrapperNode [2021-01-06 11:34:42,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:34:42,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:34:42,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:34:42,122 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:34:42,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:34:42" (1/1) ... [2021-01-06 11:34:42,165 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:34:42" (1/1) ... [2021-01-06 11:34:42,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:34:42,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:34:42,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:34:42,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:34:42,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:34:42" (1/1) ... [2021-01-06 11:34:42,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:34:42" (1/1) ... [2021-01-06 11:34:42,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:34:42" (1/1) ... [2021-01-06 11:34:42,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:34:42" (1/1) ... [2021-01-06 11:34:42,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:34:42" (1/1) ... [2021-01-06 11:34:42,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:34:42" (1/1) ... [2021-01-06 11:34:42,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:34:42" (1/1) ... [2021-01-06 11:34:42,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:34:42,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:34:42,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:34:42,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:34:42,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:34:42" (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-06 11:34:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:34:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:34:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:34:42,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:34:42,918 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:34:42,933 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:34:42,943 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:34:42,954 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:34:42,959 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:34:42,968 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:34:42,974 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:34:42,980 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:34:42,985 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:34:42,990 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:34:42,997 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:34:43,005 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:34:44,277 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-01-06 11:34:44,277 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-01-06 11:34:44,277 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2021-01-06 11:34:44,278 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2021-01-06 11:34:44,278 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##219: assume false; [2021-01-06 11:34:44,278 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##220: assume !false; [2021-01-06 11:34:44,279 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2021-01-06 11:34:44,279 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2021-01-06 11:34:44,279 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##322: assume !false; [2021-01-06 11:34:44,279 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##321: assume false; [2021-01-06 11:34:44,280 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-01-06 11:34:44,280 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-01-06 11:34:44,280 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2021-01-06 11:34:44,280 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2021-01-06 11:34:44,280 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume !false; [2021-01-06 11:34:44,281 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume false; [2021-01-06 11:34:44,281 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume false; [2021-01-06 11:34:44,286 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume !false; [2021-01-06 11:34:44,286 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##389: assume !false; [2021-01-06 11:34:44,286 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##388: assume false; [2021-01-06 11:34:44,287 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-01-06 11:34:44,287 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-01-06 11:34:44,287 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !false; [2021-01-06 11:34:44,287 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume false; [2021-01-06 11:34:44,317 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:34:44,317 INFO L299 CfgBuilder]: Removed 154 assume(true) statements. [2021-01-06 11:34:44,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:34:44 BoogieIcfgContainer [2021-01-06 11:34:44,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:34:44,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:34:44,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:34:44,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:34:44,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:34:41" (1/3) ... [2021-01-06 11:34:44,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df798e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:34:44, skipping insertion in model container [2021-01-06 11:34:44,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:34:42" (2/3) ... [2021-01-06 11:34:44,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df798e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:34:44, skipping insertion in model container [2021-01-06 11:34:44,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:34:44" (3/3) ... [2021-01-06 11:34:44,333 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2021-01-06 11:34:44,341 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:34:44,347 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2021-01-06 11:34:44,366 INFO L253 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2021-01-06 11:34:44,431 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:34:44,431 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:34:44,431 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:34:44,431 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:34:44,432 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:34:44,432 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:34:44,432 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:34:44,432 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:34:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states. [2021-01-06 11:34:44,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 11:34:44,492 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:44,493 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:34:44,493 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:44,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:44,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1766777508, now seen corresponding path program 1 times [2021-01-06 11:34:44,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:44,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713490167] [2021-01-06 11:34:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:44,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-06 11:34:44,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713490167] [2021-01-06 11:34:44,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:44,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:34:44,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052021464] [2021-01-06 11:34:44,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:34:44,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:44,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:34:44,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:34:44,849 INFO L87 Difference]: Start difference. First operand 330 states. Second operand 3 states. [2021-01-06 11:34:45,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:45,005 INFO L93 Difference]: Finished difference Result 578 states and 842 transitions. [2021-01-06 11:34:45,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:34:45,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2021-01-06 11:34:45,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:45,023 INFO L225 Difference]: With dead ends: 578 [2021-01-06 11:34:45,024 INFO L226 Difference]: Without dead ends: 324 [2021-01-06 11:34:45,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-06 11:34:45,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-01-06 11:34:45,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2021-01-06 11:34:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2021-01-06 11:34:45,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 442 transitions. [2021-01-06 11:34:45,100 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 442 transitions. Word has length 11 [2021-01-06 11:34:45,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:45,100 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 442 transitions. [2021-01-06 11:34:45,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:34:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 442 transitions. [2021-01-06 11:34:45,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-06 11:34:45,101 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:45,102 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:34:45,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:34:45,102 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:45,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:45,103 INFO L82 PathProgramCache]: Analyzing trace with hash 557701687, now seen corresponding path program 1 times [2021-01-06 11:34:45,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:45,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568572251] [2021-01-06 11:34:45,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:45,201 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-06 11:34:45,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568572251] [2021-01-06 11:34:45,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:45,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:34:45,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834294263] [2021-01-06 11:34:45,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:34:45,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:45,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:34:45,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:34:45,206 INFO L87 Difference]: Start difference. First operand 324 states and 442 transitions. Second operand 3 states. [2021-01-06 11:34:45,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:45,539 INFO L93 Difference]: Finished difference Result 433 states and 577 transitions. [2021-01-06 11:34:45,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:34:45,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2021-01-06 11:34:45,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:45,544 INFO L225 Difference]: With dead ends: 433 [2021-01-06 11:34:45,545 INFO L226 Difference]: Without dead ends: 368 [2021-01-06 11:34:45,546 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-06 11:34:45,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-01-06 11:34:45,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 351. [2021-01-06 11:34:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2021-01-06 11:34:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 479 transitions. [2021-01-06 11:34:45,591 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 479 transitions. Word has length 13 [2021-01-06 11:34:45,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:45,591 INFO L481 AbstractCegarLoop]: Abstraction has 351 states and 479 transitions. [2021-01-06 11:34:45,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:34:45,596 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 479 transitions. [2021-01-06 11:34:45,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 11:34:45,597 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:45,598 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:34:45,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:34:45,598 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:45,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:45,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1900748477, now seen corresponding path program 1 times [2021-01-06 11:34:45,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:45,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109068560] [2021-01-06 11:34:45,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:45,657 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-06 11:34:45,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109068560] [2021-01-06 11:34:45,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:45,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:34:45,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867860460] [2021-01-06 11:34:45,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:34:45,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:45,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:34:45,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:34:45,660 INFO L87 Difference]: Start difference. First operand 351 states and 479 transitions. Second operand 3 states. [2021-01-06 11:34:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:45,728 INFO L93 Difference]: Finished difference Result 554 states and 735 transitions. [2021-01-06 11:34:45,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:34:45,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2021-01-06 11:34:45,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:45,732 INFO L225 Difference]: With dead ends: 554 [2021-01-06 11:34:45,732 INFO L226 Difference]: Without dead ends: 362 [2021-01-06 11:34:45,734 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-06 11:34:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-01-06 11:34:45,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 307. [2021-01-06 11:34:45,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2021-01-06 11:34:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 421 transitions. [2021-01-06 11:34:45,769 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 421 transitions. Word has length 15 [2021-01-06 11:34:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:45,769 INFO L481 AbstractCegarLoop]: Abstraction has 307 states and 421 transitions. [2021-01-06 11:34:45,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:34:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 421 transitions. [2021-01-06 11:34:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 11:34:45,772 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:45,772 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-06 11:34:45,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:34:45,772 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:45,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:45,773 INFO L82 PathProgramCache]: Analyzing trace with hash 306593718, now seen corresponding path program 1 times [2021-01-06 11:34:45,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:45,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719588087] [2021-01-06 11:34:45,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:45,848 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-06 11:34:45,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719588087] [2021-01-06 11:34:45,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:45,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:34:45,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205147099] [2021-01-06 11:34:45,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:34:45,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:45,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:34:45,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:34:45,851 INFO L87 Difference]: Start difference. First operand 307 states and 421 transitions. Second operand 3 states. [2021-01-06 11:34:46,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:46,078 INFO L93 Difference]: Finished difference Result 307 states and 421 transitions. [2021-01-06 11:34:46,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:34:46,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2021-01-06 11:34:46,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:46,081 INFO L225 Difference]: With dead ends: 307 [2021-01-06 11:34:46,081 INFO L226 Difference]: Without dead ends: 293 [2021-01-06 11:34:46,082 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-06 11:34:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-01-06 11:34:46,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2021-01-06 11:34:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2021-01-06 11:34:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 407 transitions. [2021-01-06 11:34:46,098 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 407 transitions. Word has length 21 [2021-01-06 11:34:46,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:46,099 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 407 transitions. [2021-01-06 11:34:46,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:34:46,099 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 407 transitions. [2021-01-06 11:34:46,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 11:34:46,101 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:46,101 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-06 11:34:46,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:34:46,102 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:46,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:46,102 INFO L82 PathProgramCache]: Analyzing trace with hash 847063989, now seen corresponding path program 1 times [2021-01-06 11:34:46,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:46,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135470929] [2021-01-06 11:34:46,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:46,227 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-06 11:34:46,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135470929] [2021-01-06 11:34:46,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:46,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:34:46,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048791961] [2021-01-06 11:34:46,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:34:46,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:46,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:34:46,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:34:46,233 INFO L87 Difference]: Start difference. First operand 293 states and 407 transitions. Second operand 4 states. [2021-01-06 11:34:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:46,481 INFO L93 Difference]: Finished difference Result 318 states and 435 transitions. [2021-01-06 11:34:46,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:34:46,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2021-01-06 11:34:46,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:46,484 INFO L225 Difference]: With dead ends: 318 [2021-01-06 11:34:46,484 INFO L226 Difference]: Without dead ends: 309 [2021-01-06 11:34:46,485 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-06 11:34:46,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-01-06 11:34:46,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 305. [2021-01-06 11:34:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2021-01-06 11:34:46,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 422 transitions. [2021-01-06 11:34:46,507 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 422 transitions. Word has length 26 [2021-01-06 11:34:46,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:46,508 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 422 transitions. [2021-01-06 11:34:46,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:34:46,508 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 422 transitions. [2021-01-06 11:34:46,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 11:34:46,509 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:46,510 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-06 11:34:46,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:34:46,510 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:46,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:46,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1660315800, now seen corresponding path program 1 times [2021-01-06 11:34:46,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:46,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643964603] [2021-01-06 11:34:46,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:46,612 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-06 11:34:46,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643964603] [2021-01-06 11:34:46,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:46,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:34:46,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965027319] [2021-01-06 11:34:46,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:34:46,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:46,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:34:46,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:34:46,617 INFO L87 Difference]: Start difference. First operand 305 states and 422 transitions. Second operand 3 states. [2021-01-06 11:34:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:46,828 INFO L93 Difference]: Finished difference Result 349 states and 478 transitions. [2021-01-06 11:34:46,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:34:46,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2021-01-06 11:34:46,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:46,831 INFO L225 Difference]: With dead ends: 349 [2021-01-06 11:34:46,832 INFO L226 Difference]: Without dead ends: 302 [2021-01-06 11:34:46,832 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-06 11:34:46,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-01-06 11:34:46,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2021-01-06 11:34:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2021-01-06 11:34:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 418 transitions. [2021-01-06 11:34:46,856 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 418 transitions. Word has length 27 [2021-01-06 11:34:46,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:46,857 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 418 transitions. [2021-01-06 11:34:46,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:34:46,857 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 418 transitions. [2021-01-06 11:34:46,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 11:34:46,858 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:46,859 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-06 11:34:46,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:34:46,860 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:46,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:46,861 INFO L82 PathProgramCache]: Analyzing trace with hash -23036524, now seen corresponding path program 1 times [2021-01-06 11:34:46,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:46,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634721381] [2021-01-06 11:34:46,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:46,942 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-06 11:34:46,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634721381] [2021-01-06 11:34:46,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:46,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:34:46,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804772185] [2021-01-06 11:34:46,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:34:46,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:46,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:34:46,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:34:46,946 INFO L87 Difference]: Start difference. First operand 302 states and 418 transitions. Second operand 3 states. [2021-01-06 11:34:46,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:46,995 INFO L93 Difference]: Finished difference Result 366 states and 498 transitions. [2021-01-06 11:34:46,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:34:46,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2021-01-06 11:34:46,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:46,998 INFO L225 Difference]: With dead ends: 366 [2021-01-06 11:34:46,998 INFO L226 Difference]: Without dead ends: 315 [2021-01-06 11:34:46,998 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-06 11:34:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-01-06 11:34:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 302. [2021-01-06 11:34:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2021-01-06 11:34:47,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 417 transitions. [2021-01-06 11:34:47,022 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 417 transitions. Word has length 27 [2021-01-06 11:34:47,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:47,023 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 417 transitions. [2021-01-06 11:34:47,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:34:47,023 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 417 transitions. [2021-01-06 11:34:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 11:34:47,024 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:47,024 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-06 11:34:47,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:34:47,025 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:47,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:47,025 INFO L82 PathProgramCache]: Analyzing trace with hash 476963846, now seen corresponding path program 1 times [2021-01-06 11:34:47,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:47,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606467559] [2021-01-06 11:34:47,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:47,124 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-06 11:34:47,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606467559] [2021-01-06 11:34:47,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:47,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:34:47,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402401965] [2021-01-06 11:34:47,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:34:47,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:47,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:34:47,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:34:47,127 INFO L87 Difference]: Start difference. First operand 302 states and 417 transitions. Second operand 4 states. [2021-01-06 11:34:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:47,361 INFO L93 Difference]: Finished difference Result 310 states and 423 transitions. [2021-01-06 11:34:47,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:34:47,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2021-01-06 11:34:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:47,364 INFO L225 Difference]: With dead ends: 310 [2021-01-06 11:34:47,364 INFO L226 Difference]: Without dead ends: 306 [2021-01-06 11:34:47,365 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-06 11:34:47,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-01-06 11:34:47,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2021-01-06 11:34:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2021-01-06 11:34:47,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 416 transitions. [2021-01-06 11:34:47,385 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 416 transitions. Word has length 27 [2021-01-06 11:34:47,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:47,385 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 416 transitions. [2021-01-06 11:34:47,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:34:47,385 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 416 transitions. [2021-01-06 11:34:47,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 11:34:47,387 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:47,387 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-06 11:34:47,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:34:47,387 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:47,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:47,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1894183263, now seen corresponding path program 1 times [2021-01-06 11:34:47,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:47,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321298507] [2021-01-06 11:34:47,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:47,422 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-06 11:34:47,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321298507] [2021-01-06 11:34:47,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:47,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:34:47,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599607468] [2021-01-06 11:34:47,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:34:47,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:47,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:34:47,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:34:47,425 INFO L87 Difference]: Start difference. First operand 302 states and 416 transitions. Second operand 3 states. [2021-01-06 11:34:47,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:47,464 INFO L93 Difference]: Finished difference Result 319 states and 437 transitions. [2021-01-06 11:34:47,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:34:47,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2021-01-06 11:34:47,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:47,467 INFO L225 Difference]: With dead ends: 319 [2021-01-06 11:34:47,467 INFO L226 Difference]: Without dead ends: 273 [2021-01-06 11:34:47,467 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-06 11:34:47,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-01-06 11:34:47,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 249. [2021-01-06 11:34:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2021-01-06 11:34:47,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 347 transitions. [2021-01-06 11:34:47,485 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 347 transitions. Word has length 28 [2021-01-06 11:34:47,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:47,485 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 347 transitions. [2021-01-06 11:34:47,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:34:47,485 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 347 transitions. [2021-01-06 11:34:47,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 11:34:47,486 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:47,487 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-06 11:34:47,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:34:47,487 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:47,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:47,488 INFO L82 PathProgramCache]: Analyzing trace with hash 403678015, now seen corresponding path program 1 times [2021-01-06 11:34:47,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:47,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199419818] [2021-01-06 11:34:47,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:34:47,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199419818] [2021-01-06 11:34:47,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:47,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:34:47,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444271332] [2021-01-06 11:34:47,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:34:47,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:47,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:34:47,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:34:47,535 INFO L87 Difference]: Start difference. First operand 249 states and 347 transitions. Second operand 5 states. [2021-01-06 11:34:47,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:47,773 INFO L93 Difference]: Finished difference Result 410 states and 537 transitions. [2021-01-06 11:34:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 11:34:47,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2021-01-06 11:34:47,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:47,776 INFO L225 Difference]: With dead ends: 410 [2021-01-06 11:34:47,776 INFO L226 Difference]: Without dead ends: 359 [2021-01-06 11:34:47,777 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-06 11:34:47,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-01-06 11:34:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 284. [2021-01-06 11:34:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2021-01-06 11:34:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 399 transitions. [2021-01-06 11:34:47,798 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 399 transitions. Word has length 30 [2021-01-06 11:34:47,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:47,798 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 399 transitions. [2021-01-06 11:34:47,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:34:47,798 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 399 transitions. [2021-01-06 11:34:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 11:34:47,799 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:47,799 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-06 11:34:47,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:34:47,800 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:47,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:47,801 INFO L82 PathProgramCache]: Analyzing trace with hash 361661719, now seen corresponding path program 1 times [2021-01-06 11:34:47,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:47,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935198659] [2021-01-06 11:34:47,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:47,843 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-06 11:34:47,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935198659] [2021-01-06 11:34:47,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:47,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:34:47,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483137906] [2021-01-06 11:34:47,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:34:47,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:47,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:34:47,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:34:47,845 INFO L87 Difference]: Start difference. First operand 284 states and 399 transitions. Second operand 5 states. [2021-01-06 11:34:48,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:48,043 INFO L93 Difference]: Finished difference Result 341 states and 456 transitions. [2021-01-06 11:34:48,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:34:48,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2021-01-06 11:34:48,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:48,046 INFO L225 Difference]: With dead ends: 341 [2021-01-06 11:34:48,046 INFO L226 Difference]: Without dead ends: 315 [2021-01-06 11:34:48,047 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-06 11:34:48,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-01-06 11:34:48,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 271. [2021-01-06 11:34:48,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2021-01-06 11:34:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 381 transitions. [2021-01-06 11:34:48,068 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 381 transitions. Word has length 30 [2021-01-06 11:34:48,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:48,068 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 381 transitions. [2021-01-06 11:34:48,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:34:48,069 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 381 transitions. [2021-01-06 11:34:48,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 11:34:48,070 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:48,070 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-06 11:34:48,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:34:48,070 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:48,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:48,071 INFO L82 PathProgramCache]: Analyzing trace with hash -959450186, now seen corresponding path program 1 times [2021-01-06 11:34:48,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:48,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961257251] [2021-01-06 11:34:48,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:48,117 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-06 11:34:48,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961257251] [2021-01-06 11:34:48,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:48,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:34:48,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984984417] [2021-01-06 11:34:48,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:34:48,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:48,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:34:48,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:34:48,120 INFO L87 Difference]: Start difference. First operand 271 states and 381 transitions. Second operand 4 states. [2021-01-06 11:34:48,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:48,263 INFO L93 Difference]: Finished difference Result 305 states and 415 transitions. [2021-01-06 11:34:48,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:34:48,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2021-01-06 11:34:48,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:48,265 INFO L225 Difference]: With dead ends: 305 [2021-01-06 11:34:48,265 INFO L226 Difference]: Without dead ends: 271 [2021-01-06 11:34:48,266 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-06 11:34:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-01-06 11:34:48,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2021-01-06 11:34:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2021-01-06 11:34:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 368 transitions. [2021-01-06 11:34:48,310 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 368 transitions. Word has length 31 [2021-01-06 11:34:48,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:48,310 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 368 transitions. [2021-01-06 11:34:48,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:34:48,310 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 368 transitions. [2021-01-06 11:34:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 11:34:48,311 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:48,311 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-06 11:34:48,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:34:48,312 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:48,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:48,313 INFO L82 PathProgramCache]: Analyzing trace with hash -378484437, now seen corresponding path program 1 times [2021-01-06 11:34:48,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:48,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062888125] [2021-01-06 11:34:48,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:48,361 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-06 11:34:48,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062888125] [2021-01-06 11:34:48,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:48,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:34:48,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554518117] [2021-01-06 11:34:48,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:34:48,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:48,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:34:48,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:34:48,364 INFO L87 Difference]: Start difference. First operand 271 states and 368 transitions. Second operand 3 states. [2021-01-06 11:34:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:48,418 INFO L93 Difference]: Finished difference Result 499 states and 682 transitions. [2021-01-06 11:34:48,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:34:48,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2021-01-06 11:34:48,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:48,422 INFO L225 Difference]: With dead ends: 499 [2021-01-06 11:34:48,422 INFO L226 Difference]: Without dead ends: 495 [2021-01-06 11:34:48,423 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-06 11:34:48,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2021-01-06 11:34:48,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 321. [2021-01-06 11:34:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2021-01-06 11:34:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 434 transitions. [2021-01-06 11:34:48,450 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 434 transitions. Word has length 31 [2021-01-06 11:34:48,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:48,450 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 434 transitions. [2021-01-06 11:34:48,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:34:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 434 transitions. [2021-01-06 11:34:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 11:34:48,451 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:48,452 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-06 11:34:48,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:34:48,452 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:48,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:48,453 INFO L82 PathProgramCache]: Analyzing trace with hash -378424855, now seen corresponding path program 1 times [2021-01-06 11:34:48,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:48,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820797295] [2021-01-06 11:34:48,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:48,496 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-06 11:34:48,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820797295] [2021-01-06 11:34:48,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:48,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:34:48,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225867498] [2021-01-06 11:34:48,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:34:48,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:48,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:34:48,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:34:48,498 INFO L87 Difference]: Start difference. First operand 321 states and 434 transitions. Second operand 4 states. [2021-01-06 11:34:48,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:48,552 INFO L93 Difference]: Finished difference Result 367 states and 489 transitions. [2021-01-06 11:34:48,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:34:48,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2021-01-06 11:34:48,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:48,555 INFO L225 Difference]: With dead ends: 367 [2021-01-06 11:34:48,555 INFO L226 Difference]: Without dead ends: 309 [2021-01-06 11:34:48,555 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-06 11:34:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-01-06 11:34:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2021-01-06 11:34:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2021-01-06 11:34:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 416 transitions. [2021-01-06 11:34:48,583 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 416 transitions. Word has length 31 [2021-01-06 11:34:48,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:48,583 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 416 transitions. [2021-01-06 11:34:48,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:34:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 416 transitions. [2021-01-06 11:34:48,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-06 11:34:48,584 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:48,584 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-06 11:34:48,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:34:48,585 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:48,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:48,585 INFO L82 PathProgramCache]: Analyzing trace with hash -329006014, now seen corresponding path program 1 times [2021-01-06 11:34:48,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:48,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096827748] [2021-01-06 11:34:48,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:34:48,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096827748] [2021-01-06 11:34:48,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:48,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:34:48,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344936502] [2021-01-06 11:34:48,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:34:48,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:48,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:34:48,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:34:48,635 INFO L87 Difference]: Start difference. First operand 309 states and 416 transitions. Second operand 4 states. [2021-01-06 11:34:48,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:48,776 INFO L93 Difference]: Finished difference Result 343 states and 459 transitions. [2021-01-06 11:34:48,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:34:48,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2021-01-06 11:34:48,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:48,778 INFO L225 Difference]: With dead ends: 343 [2021-01-06 11:34:48,778 INFO L226 Difference]: Without dead ends: 297 [2021-01-06 11:34:48,779 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-06 11:34:48,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-01-06 11:34:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2021-01-06 11:34:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2021-01-06 11:34:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 400 transitions. [2021-01-06 11:34:48,805 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 400 transitions. Word has length 32 [2021-01-06 11:34:48,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:48,805 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 400 transitions. [2021-01-06 11:34:48,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:34:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 400 transitions. [2021-01-06 11:34:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 11:34:48,806 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:48,807 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-06 11:34:48,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:34:48,807 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:48,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:48,808 INFO L82 PathProgramCache]: Analyzing trace with hash 2012498225, now seen corresponding path program 1 times [2021-01-06 11:34:48,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:48,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16164563] [2021-01-06 11:34:48,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:48,875 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-06 11:34:48,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16164563] [2021-01-06 11:34:48,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:48,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 11:34:48,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154539316] [2021-01-06 11:34:48,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:34:48,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:48,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:34:48,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:34:48,879 INFO L87 Difference]: Start difference. First operand 297 states and 400 transitions. Second operand 7 states. [2021-01-06 11:34:49,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:49,129 INFO L93 Difference]: Finished difference Result 330 states and 433 transitions. [2021-01-06 11:34:49,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 11:34:49,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2021-01-06 11:34:49,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:49,131 INFO L225 Difference]: With dead ends: 330 [2021-01-06 11:34:49,131 INFO L226 Difference]: Without dead ends: 267 [2021-01-06 11:34:49,132 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-06 11:34:49,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-01-06 11:34:49,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 245. [2021-01-06 11:34:49,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2021-01-06 11:34:49,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 328 transitions. [2021-01-06 11:34:49,153 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 328 transitions. Word has length 33 [2021-01-06 11:34:49,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:49,153 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 328 transitions. [2021-01-06 11:34:49,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:34:49,154 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 328 transitions. [2021-01-06 11:34:49,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-06 11:34:49,154 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:49,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] [2021-01-06 11:34:49,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:34:49,155 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:49,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:49,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1781478438, now seen corresponding path program 1 times [2021-01-06 11:34:49,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:49,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250833910] [2021-01-06 11:34:49,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:49,183 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-06 11:34:49,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250833910] [2021-01-06 11:34:49,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:49,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:34:49,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842430496] [2021-01-06 11:34:49,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:34:49,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:49,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:34:49,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:34:49,186 INFO L87 Difference]: Start difference. First operand 245 states and 328 transitions. Second operand 3 states. [2021-01-06 11:34:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:49,275 INFO L93 Difference]: Finished difference Result 356 states and 458 transitions. [2021-01-06 11:34:49,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:34:49,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2021-01-06 11:34:49,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:49,277 INFO L225 Difference]: With dead ends: 356 [2021-01-06 11:34:49,277 INFO L226 Difference]: Without dead ends: 299 [2021-01-06 11:34:49,278 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-06 11:34:49,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-01-06 11:34:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 247. [2021-01-06 11:34:49,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2021-01-06 11:34:49,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 330 transitions. [2021-01-06 11:34:49,300 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 330 transitions. Word has length 34 [2021-01-06 11:34:49,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:49,301 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 330 transitions. [2021-01-06 11:34:49,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:34:49,301 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 330 transitions. [2021-01-06 11:34:49,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-06 11:34:49,301 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:49,302 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-06 11:34:49,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:34:49,302 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:49,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:49,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1662125936, now seen corresponding path program 1 times [2021-01-06 11:34:49,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:49,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113881729] [2021-01-06 11:34:49,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:49,330 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-06 11:34:49,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113881729] [2021-01-06 11:34:49,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:49,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:34:49,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767697622] [2021-01-06 11:34:49,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:34:49,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:49,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:34:49,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:34:49,332 INFO L87 Difference]: Start difference. First operand 247 states and 330 transitions. Second operand 3 states. [2021-01-06 11:34:49,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:49,413 INFO L93 Difference]: Finished difference Result 263 states and 349 transitions. [2021-01-06 11:34:49,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:34:49,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2021-01-06 11:34:49,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:49,416 INFO L225 Difference]: With dead ends: 263 [2021-01-06 11:34:49,416 INFO L226 Difference]: Without dead ends: 259 [2021-01-06 11:34:49,416 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-06 11:34:49,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-01-06 11:34:49,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 251. [2021-01-06 11:34:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2021-01-06 11:34:49,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 333 transitions. [2021-01-06 11:34:49,454 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 333 transitions. Word has length 34 [2021-01-06 11:34:49,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:49,455 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 333 transitions. [2021-01-06 11:34:49,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:34:49,455 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 333 transitions. [2021-01-06 11:34:49,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-06 11:34:49,456 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:49,456 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-06 11:34:49,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:34:49,456 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:49,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:49,457 INFO L82 PathProgramCache]: Analyzing trace with hash -822248422, now seen corresponding path program 1 times [2021-01-06 11:34:49,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:49,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117602281] [2021-01-06 11:34:49,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:49,512 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-06 11:34:49,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117602281] [2021-01-06 11:34:49,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:49,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:34:49,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643019821] [2021-01-06 11:34:49,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:34:49,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:49,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:34:49,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:34:49,515 INFO L87 Difference]: Start difference. First operand 251 states and 333 transitions. Second operand 5 states. [2021-01-06 11:34:49,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:49,674 INFO L93 Difference]: Finished difference Result 304 states and 384 transitions. [2021-01-06 11:34:49,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:34:49,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2021-01-06 11:34:49,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:49,676 INFO L225 Difference]: With dead ends: 304 [2021-01-06 11:34:49,676 INFO L226 Difference]: Without dead ends: 300 [2021-01-06 11:34:49,676 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-06 11:34:49,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-01-06 11:34:49,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 251. [2021-01-06 11:34:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2021-01-06 11:34:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 331 transitions. [2021-01-06 11:34:49,700 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 331 transitions. Word has length 34 [2021-01-06 11:34:49,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:49,700 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 331 transitions. [2021-01-06 11:34:49,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:34:49,701 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 331 transitions. [2021-01-06 11:34:49,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-06 11:34:49,701 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:49,702 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-06 11:34:49,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:34:49,702 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:49,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:49,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1935189253, now seen corresponding path program 1 times [2021-01-06 11:34:49,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:49,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263316966] [2021-01-06 11:34:49,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:49,792 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-06 11:34:49,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263316966] [2021-01-06 11:34:49,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:49,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 11:34:49,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365221621] [2021-01-06 11:34:49,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:34:49,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:49,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:34:49,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:34:49,794 INFO L87 Difference]: Start difference. First operand 251 states and 331 transitions. Second operand 7 states. [2021-01-06 11:34:49,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:49,971 INFO L93 Difference]: Finished difference Result 269 states and 351 transitions. [2021-01-06 11:34:49,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:34:49,972 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2021-01-06 11:34:49,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:49,973 INFO L225 Difference]: With dead ends: 269 [2021-01-06 11:34:49,973 INFO L226 Difference]: Without dead ends: 250 [2021-01-06 11:34:49,974 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-06 11:34:49,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-01-06 11:34:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2021-01-06 11:34:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2021-01-06 11:34:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 329 transitions. [2021-01-06 11:34:49,996 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 329 transitions. Word has length 34 [2021-01-06 11:34:49,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:49,996 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 329 transitions. [2021-01-06 11:34:49,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:34:49,996 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 329 transitions. [2021-01-06 11:34:49,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 11:34:49,997 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:49,997 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-06 11:34:49,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:34:49,997 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:49,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:49,998 INFO L82 PathProgramCache]: Analyzing trace with hash -21362253, now seen corresponding path program 1 times [2021-01-06 11:34:49,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:49,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649033523] [2021-01-06 11:34:49,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:50,063 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-06 11:34:50,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649033523] [2021-01-06 11:34:50,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:50,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:34:50,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663887029] [2021-01-06 11:34:50,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:34:50,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:50,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:34:50,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:34:50,065 INFO L87 Difference]: Start difference. First operand 250 states and 329 transitions. Second operand 4 states. [2021-01-06 11:34:50,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:50,186 INFO L93 Difference]: Finished difference Result 278 states and 356 transitions. [2021-01-06 11:34:50,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:34:50,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2021-01-06 11:34:50,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:50,188 INFO L225 Difference]: With dead ends: 278 [2021-01-06 11:34:50,188 INFO L226 Difference]: Without dead ends: 265 [2021-01-06 11:34:50,188 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-06 11:34:50,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-01-06 11:34:50,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 239. [2021-01-06 11:34:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-06 11:34:50,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 314 transitions. [2021-01-06 11:34:50,223 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 314 transitions. Word has length 35 [2021-01-06 11:34:50,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:50,223 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 314 transitions. [2021-01-06 11:34:50,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:34:50,223 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 314 transitions. [2021-01-06 11:34:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 11:34:50,224 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:50,224 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-06 11:34:50,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 11:34:50,224 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:50,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:50,225 INFO L82 PathProgramCache]: Analyzing trace with hash 272561262, now seen corresponding path program 1 times [2021-01-06 11:34:50,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:50,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684674591] [2021-01-06 11:34:50,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:50,295 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-06 11:34:50,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684674591] [2021-01-06 11:34:50,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:50,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:34:50,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403022241] [2021-01-06 11:34:50,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:34:50,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:50,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:34:50,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:34:50,297 INFO L87 Difference]: Start difference. First operand 239 states and 314 transitions. Second operand 5 states. [2021-01-06 11:34:50,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:50,441 INFO L93 Difference]: Finished difference Result 297 states and 372 transitions. [2021-01-06 11:34:50,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:34:50,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2021-01-06 11:34:50,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:50,443 INFO L225 Difference]: With dead ends: 297 [2021-01-06 11:34:50,444 INFO L226 Difference]: Without dead ends: 266 [2021-01-06 11:34:50,446 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-06 11:34:50,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-01-06 11:34:50,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 239. [2021-01-06 11:34:50,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-06 11:34:50,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 308 transitions. [2021-01-06 11:34:50,470 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 308 transitions. Word has length 35 [2021-01-06 11:34:50,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:50,470 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 308 transitions. [2021-01-06 11:34:50,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:34:50,470 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 308 transitions. [2021-01-06 11:34:50,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 11:34:50,471 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:50,471 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-06 11:34:50,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:34:50,471 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:50,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:50,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1030061199, now seen corresponding path program 1 times [2021-01-06 11:34:50,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:50,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460113652] [2021-01-06 11:34:50,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:50,501 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-06 11:34:50,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460113652] [2021-01-06 11:34:50,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:50,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:34:50,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760633569] [2021-01-06 11:34:50,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:34:50,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:50,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:34:50,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:34:50,508 INFO L87 Difference]: Start difference. First operand 239 states and 308 transitions. Second operand 3 states. [2021-01-06 11:34:50,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:50,537 INFO L93 Difference]: Finished difference Result 257 states and 328 transitions. [2021-01-06 11:34:50,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:34:50,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2021-01-06 11:34:50,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:50,539 INFO L225 Difference]: With dead ends: 257 [2021-01-06 11:34:50,539 INFO L226 Difference]: Without dead ends: 231 [2021-01-06 11:34:50,540 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-06 11:34:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-01-06 11:34:50,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2021-01-06 11:34:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2021-01-06 11:34:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 297 transitions. [2021-01-06 11:34:50,563 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 297 transitions. Word has length 35 [2021-01-06 11:34:50,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:50,563 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 297 transitions. [2021-01-06 11:34:50,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:34:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 297 transitions. [2021-01-06 11:34:50,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 11:34:50,564 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:50,565 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-06 11:34:50,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:34:50,565 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:50,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:50,565 INFO L82 PathProgramCache]: Analyzing trace with hash -2102888975, now seen corresponding path program 1 times [2021-01-06 11:34:50,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:50,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495637171] [2021-01-06 11:34:50,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:50,625 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-06 11:34:50,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495637171] [2021-01-06 11:34:50,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:50,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:34:50,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560715646] [2021-01-06 11:34:50,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:34:50,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:50,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:34:50,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:34:50,630 INFO L87 Difference]: Start difference. First operand 231 states and 297 transitions. Second operand 4 states. [2021-01-06 11:34:50,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:50,747 INFO L93 Difference]: Finished difference Result 262 states and 327 transitions. [2021-01-06 11:34:50,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:34:50,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2021-01-06 11:34:50,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:50,749 INFO L225 Difference]: With dead ends: 262 [2021-01-06 11:34:50,749 INFO L226 Difference]: Without dead ends: 257 [2021-01-06 11:34:50,749 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-06 11:34:50,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-01-06 11:34:50,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 251. [2021-01-06 11:34:50,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2021-01-06 11:34:50,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 317 transitions. [2021-01-06 11:34:50,777 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 317 transitions. Word has length 35 [2021-01-06 11:34:50,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:50,777 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 317 transitions. [2021-01-06 11:34:50,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:34:50,777 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 317 transitions. [2021-01-06 11:34:50,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 11:34:50,778 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:50,778 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-06 11:34:50,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 11:34:50,778 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:50,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:50,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1665760845, now seen corresponding path program 1 times [2021-01-06 11:34:50,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:50,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816247109] [2021-01-06 11:34:50,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:50,825 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-06 11:34:50,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816247109] [2021-01-06 11:34:50,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:50,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 11:34:50,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585705239] [2021-01-06 11:34:50,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:34:50,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:50,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:34:50,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:34:50,827 INFO L87 Difference]: Start difference. First operand 251 states and 317 transitions. Second operand 7 states. [2021-01-06 11:34:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:51,061 INFO L93 Difference]: Finished difference Result 287 states and 353 transitions. [2021-01-06 11:34:51,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 11:34:51,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2021-01-06 11:34:51,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:51,063 INFO L225 Difference]: With dead ends: 287 [2021-01-06 11:34:51,063 INFO L226 Difference]: Without dead ends: 208 [2021-01-06 11:34:51,063 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-06 11:34:51,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-01-06 11:34:51,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 192. [2021-01-06 11:34:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2021-01-06 11:34:51,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 230 transitions. [2021-01-06 11:34:51,084 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 230 transitions. Word has length 35 [2021-01-06 11:34:51,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:51,084 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 230 transitions. [2021-01-06 11:34:51,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:34:51,085 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 230 transitions. [2021-01-06 11:34:51,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 11:34:51,085 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:51,085 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-06 11:34:51,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 11:34:51,086 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:51,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:51,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1804254012, now seen corresponding path program 1 times [2021-01-06 11:34:51,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:51,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712579440] [2021-01-06 11:34:51,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:51,163 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-06 11:34:51,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712579440] [2021-01-06 11:34:51,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:51,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 11:34:51,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863261536] [2021-01-06 11:34:51,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 11:34:51,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:51,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 11:34:51,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:34:51,166 INFO L87 Difference]: Start difference. First operand 192 states and 230 transitions. Second operand 6 states. [2021-01-06 11:34:51,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:51,297 INFO L93 Difference]: Finished difference Result 208 states and 246 transitions. [2021-01-06 11:34:51,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 11:34:51,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2021-01-06 11:34:51,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:51,298 INFO L225 Difference]: With dead ends: 208 [2021-01-06 11:34:51,298 INFO L226 Difference]: Without dead ends: 168 [2021-01-06 11:34:51,298 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-06 11:34:51,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-01-06 11:34:51,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2021-01-06 11:34:51,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:34:51,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 197 transitions. [2021-01-06 11:34:51,318 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 197 transitions. Word has length 35 [2021-01-06 11:34:51,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:51,318 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 197 transitions. [2021-01-06 11:34:51,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 11:34:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 197 transitions. [2021-01-06 11:34:51,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 11:34:51,319 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:51,319 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-06 11:34:51,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 11:34:51,320 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:51,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:51,320 INFO L82 PathProgramCache]: Analyzing trace with hash -961302835, now seen corresponding path program 1 times [2021-01-06 11:34:51,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:51,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336009387] [2021-01-06 11:34:51,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:34:51,365 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-06 11:34:51,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336009387] [2021-01-06 11:34:51,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:34:51,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 11:34:51,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454574289] [2021-01-06 11:34:51,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:34:51,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:34:51,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:34:51,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:34:51,367 INFO L87 Difference]: Start difference. First operand 168 states and 197 transitions. Second operand 7 states. [2021-01-06 11:34:51,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:34:51,543 INFO L93 Difference]: Finished difference Result 224 states and 255 transitions. [2021-01-06 11:34:51,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 11:34:51,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2021-01-06 11:34:51,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:34:51,545 INFO L225 Difference]: With dead ends: 224 [2021-01-06 11:34:51,545 INFO L226 Difference]: Without dead ends: 195 [2021-01-06 11:34:51,545 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-06 11:34:51,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-01-06 11:34:51,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 167. [2021-01-06 11:34:51,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2021-01-06 11:34:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2021-01-06 11:34:51,566 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 36 [2021-01-06 11:34:51,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:34:51,566 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2021-01-06 11:34:51,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:34:51,566 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2021-01-06 11:34:51,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 11:34:51,567 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:34:51,567 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-06 11:34:51,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 11:34:51,568 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:34:51,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:34:51,568 INFO L82 PathProgramCache]: Analyzing trace with hash 724480386, now seen corresponding path program 1 times [2021-01-06 11:34:51,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:34:51,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749629744] [2021-01-06 11:34:51,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:34:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:34:51,582 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:34:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:34:51,620 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:34:51,657 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:34:51,657 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:34:51,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 11:34:51,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:34:51 BoogieIcfgContainer [2021-01-06 11:34:51,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:34:51,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:34:51,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:34:51,748 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:34:51,748 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:34:44" (3/4) ... [2021-01-06 11:34:51,750 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 11:34:51,889 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c-witness.graphml [2021-01-06 11:34:51,889 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:34:51,891 INFO L168 Benchmark]: Toolchain (without parser) took 10305.37 ms. Allocated memory was 166.7 MB in the beginning and 270.5 MB in the end (delta: 103.8 MB). Free memory was 141.4 MB in the beginning and 226.5 MB in the end (delta: -85.2 MB). Peak memory consumption was 19.3 MB. Max. memory is 8.0 GB. [2021-01-06 11:34:51,891 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 125.8 MB. Free memory is still 81.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:34:51,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 529.50 ms. Allocated memory is still 166.7 MB. Free memory was 141.2 MB in the beginning and 122.4 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:34:51,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 147.97 ms. Allocated memory is still 166.7 MB. Free memory was 122.3 MB in the beginning and 116.2 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2021-01-06 11:34:51,892 INFO L168 Benchmark]: Boogie Preprocessor took 139.63 ms. Allocated memory is still 166.7 MB. Free memory was 116.2 MB in the beginning and 112.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:34:51,892 INFO L168 Benchmark]: RCFGBuilder took 1911.68 ms. Allocated memory is still 166.7 MB. Free memory was 112.0 MB in the beginning and 134.7 MB in the end (delta: -22.7 MB). Peak memory consumption was 67.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:34:51,893 INFO L168 Benchmark]: TraceAbstraction took 7422.95 ms. Allocated memory was 166.7 MB in the beginning and 270.5 MB in the end (delta: 103.8 MB). Free memory was 134.2 MB in the beginning and 236.5 MB in the end (delta: -102.3 MB). Peak memory consumption was 149.4 MB. Max. memory is 8.0 GB. [2021-01-06 11:34:51,893 INFO L168 Benchmark]: Witness Printer took 141.63 ms. Allocated memory is still 270.5 MB. Free memory was 236.5 MB in the beginning and 226.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-01-06 11:34:51,895 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.19 ms. Allocated memory is still 125.8 MB. Free memory is still 81.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 529.50 ms. Allocated memory is still 166.7 MB. Free memory was 141.2 MB in the beginning and 122.4 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 147.97 ms. Allocated memory is still 166.7 MB. Free memory was 122.3 MB in the beginning and 116.2 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 139.63 ms. Allocated memory is still 166.7 MB. Free memory was 116.2 MB in the beginning and 112.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1911.68 ms. Allocated memory is still 166.7 MB. Free memory was 112.0 MB in the beginning and 134.7 MB in the end (delta: -22.7 MB). Peak memory consumption was 67.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7422.95 ms. Allocated memory was 166.7 MB in the beginning and 270.5 MB in the end (delta: 103.8 MB). Free memory was 134.2 MB in the beginning and 236.5 MB in the end (delta: -102.3 MB). Peak memory consumption was 149.4 MB. Max. memory is 8.0 GB. * Witness Printer took 141.63 ms. Allocated memory is still 270.5 MB. Free memory was 236.5 MB in the beginning and 226.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1013]: a call to reach_error is reachable a call to reach_error is reachable We found a 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, 330 locations, 30 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.2s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7955 SDtfs, 5619 SDslu, 10692 SDs, 0 SdLazy, 2215 SolverSat, 315 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred 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.7s AutomataMinimizationTime, 27 MinimizatonAttempts, 644 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 832 NumberOfCodeBlocks, 832 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 768 ConstructedInterpolants, 0 QuantifiedInterpolants, 70143 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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 proved your program to be incorrect! Received shutdown request...