/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 18:22:08,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 18:22:08,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 18:22:08,827 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 18:22:08,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 18:22:08,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 18:22:08,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 18:22:08,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 18:22:08,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 18:22:08,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 18:22:08,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 18:22:08,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 18:22:08,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 18:22:08,874 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 18:22:08,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 18:22:08,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 18:22:08,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 18:22:08,882 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 18:22:08,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 18:22:08,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 18:22:08,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 18:22:08,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 18:22:08,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 18:22:08,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 18:22:08,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 18:22:08,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 18:22:08,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 18:22:08,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 18:22:08,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 18:22:08,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 18:22:08,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 18:22:08,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 18:22:08,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 18:22:08,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 18:22:08,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 18:22:08,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 18:22:08,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 18:22:08,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 18:22:08,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 18:22:08,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 18:22:08,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 18:22:08,927 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-23 18:22:08,979 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 18:22:08,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 18:22:08,984 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-23 18:22:08,984 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-23 18:22:08,984 INFO L138 SettingsManager]: * Use SBE=true [2020-10-23 18:22:08,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 18:22:08,984 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 18:22:08,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 18:22:08,985 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 18:22:08,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 18:22:08,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 18:22:08,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 18:22:08,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 18:22:08,987 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 18:22:08,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 18:22:08,987 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 18:22:08,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 18:22:08,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 18:22:08,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-23 18:22:08,988 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 18:22:08,988 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 18:22:08,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 18:22:08,989 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 18:22:08,989 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-23 18:22:08,989 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-23 18:22:08,989 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-23 18:22:08,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-23 18:22:08,990 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 18:22:08,990 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-23 18:22:08,990 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-10-23 18:22:09,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 18:22:09,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 18:22:09,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 18:22:09,402 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 18:22:09,403 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 18:22:09,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2020-10-23 18:22:09,468 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0151fe1a4/b1ec9fbd84ac41598134ec0f71e7bfc6/FLAG7973cbad7 [2020-10-23 18:22:10,139 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 18:22:10,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2020-10-23 18:22:10,158 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0151fe1a4/b1ec9fbd84ac41598134ec0f71e7bfc6/FLAG7973cbad7 [2020-10-23 18:22:10,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0151fe1a4/b1ec9fbd84ac41598134ec0f71e7bfc6 [2020-10-23 18:22:10,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 18:22:10,405 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 18:22:10,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 18:22:10,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 18:22:10,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 18:22:10,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:22:10" (1/1) ... [2020-10-23 18:22:10,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@621b8120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:10, skipping insertion in model container [2020-10-23 18:22:10,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:22:10" (1/1) ... [2020-10-23 18:22:10,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 18:22:10,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 18:22:10,806 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:22:10,816 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 18:22:10,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:22:10,914 INFO L208 MainTranslator]: Completed translation [2020-10-23 18:22:10,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:10 WrapperNode [2020-10-23 18:22:10,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 18:22:10,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 18:22:10,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 18:22:10,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 18:22:10,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:10" (1/1) ... [2020-10-23 18:22:10,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:10" (1/1) ... [2020-10-23 18:22:10,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:10" (1/1) ... [2020-10-23 18:22:10,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:10" (1/1) ... [2020-10-23 18:22:10,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:10" (1/1) ... [2020-10-23 18:22:11,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:10" (1/1) ... [2020-10-23 18:22:11,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:10" (1/1) ... [2020-10-23 18:22:11,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 18:22:11,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 18:22:11,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 18:22:11,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 18:22:11,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2020-10-23 18:22:11,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 18:22:11,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 18:22:11,118 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 18:22:11,118 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-10-23 18:22:11,118 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-10-23 18:22:11,119 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2020-10-23 18:22:11,119 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 18:22:11,119 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-10-23 18:22:11,120 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-10-23 18:22:11,121 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-10-23 18:22:11,121 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-10-23 18:22:11,121 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-10-23 18:22:11,121 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2020-10-23 18:22:11,122 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2020-10-23 18:22:11,122 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2020-10-23 18:22:11,125 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2020-10-23 18:22:11,125 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2020-10-23 18:22:11,125 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2020-10-23 18:22:11,125 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-10-23 18:22:11,125 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 18:22:11,126 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 18:22:11,126 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 18:22:11,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 18:22:11,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-10-23 18:22:11,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 18:22:11,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-10-23 18:22:11,126 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2020-10-23 18:22:11,126 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2020-10-23 18:22:11,127 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-10-23 18:22:11,127 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-10-23 18:22:11,127 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-10-23 18:22:11,127 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2020-10-23 18:22:11,127 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2020-10-23 18:22:11,127 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2020-10-23 18:22:11,127 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2020-10-23 18:22:11,127 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2020-10-23 18:22:11,128 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-10-23 18:22:11,128 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-10-23 18:22:11,128 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-10-23 18:22:11,128 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-10-23 18:22:11,128 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 18:22:11,128 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-10-23 18:22:11,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 18:22:11,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 18:22:11,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 18:22:11,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 18:22:11,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 18:22:11,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 18:22:11,509 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-23 18:22:11,624 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2020-10-23 18:22:11,625 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2020-10-23 18:22:11,631 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-23 18:22:11,669 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2020-10-23 18:22:11,670 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2020-10-23 18:22:11,807 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-23 18:22:11,847 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-10-23 18:22:11,848 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-10-23 18:22:11,867 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-23 18:22:12,059 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2020-10-23 18:22:12,059 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2020-10-23 18:22:12,063 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-23 18:22:12,086 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2020-10-23 18:22:12,086 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2020-10-23 18:22:12,091 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-23 18:22:12,120 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2020-10-23 18:22:12,120 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2020-10-23 18:22:12,169 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 18:22:12,169 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-23 18:22:12,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:22:12 BoogieIcfgContainer [2020-10-23 18:22:12,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 18:22:12,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 18:22:12,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 18:22:12,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 18:22:12,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:22:10" (1/3) ... [2020-10-23 18:22:12,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a83630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:22:12, skipping insertion in model container [2020-10-23 18:22:12,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:22:10" (2/3) ... [2020-10-23 18:22:12,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a83630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:22:12, skipping insertion in model container [2020-10-23 18:22:12,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:22:12" (3/3) ... [2020-10-23 18:22:12,181 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2020-10-23 18:22:12,192 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-23 18:22:12,197 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 18:22:12,210 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 18:22:12,240 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 18:22:12,241 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 18:22:12,241 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-23 18:22:12,241 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 18:22:12,241 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 18:22:12,241 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 18:22:12,241 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 18:22:12,242 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 18:22:12,265 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states. [2020-10-23 18:22:12,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-23 18:22:12,272 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:12,273 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] [2020-10-23 18:22:12,273 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:12,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:12,280 INFO L82 PathProgramCache]: Analyzing trace with hash -2097743147, now seen corresponding path program 1 times [2020-10-23 18:22:12,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:12,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142601438] [2020-10-23 18:22:12,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:12,672 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-23 18:22:12,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:12,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:12,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:12,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142601438] [2020-10-23 18:22:12,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:12,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-23 18:22:12,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275494148] [2020-10-23 18:22:12,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-23 18:22:12,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:12,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-23 18:22:12,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-23 18:22:12,806 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 5 states. [2020-10-23 18:22:13,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:13,919 INFO L93 Difference]: Finished difference Result 420 states and 630 transitions. [2020-10-23 18:22:13,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-23 18:22:13,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-23 18:22:13,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:13,936 INFO L225 Difference]: With dead ends: 420 [2020-10-23 18:22:13,936 INFO L226 Difference]: Without dead ends: 257 [2020-10-23 18:22:13,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-23 18:22:13,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-10-23 18:22:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 229. [2020-10-23 18:22:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-10-23 18:22:14,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 323 transitions. [2020-10-23 18:22:14,059 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 323 transitions. Word has length 21 [2020-10-23 18:22:14,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:14,059 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 323 transitions. [2020-10-23 18:22:14,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-23 18:22:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 323 transitions. [2020-10-23 18:22:14,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-23 18:22:14,062 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:14,062 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] [2020-10-23 18:22:14,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 18:22:14,063 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:14,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:14,064 INFO L82 PathProgramCache]: Analyzing trace with hash -360253698, now seen corresponding path program 1 times [2020-10-23 18:22:14,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:14,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697170256] [2020-10-23 18:22:14,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:14,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:14,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:14,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:14,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:14,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697170256] [2020-10-23 18:22:14,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:14,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 18:22:14,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925337356] [2020-10-23 18:22:14,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 18:22:14,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:14,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 18:22:14,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-23 18:22:14,427 INFO L87 Difference]: Start difference. First operand 229 states and 323 transitions. Second operand 6 states. [2020-10-23 18:22:14,570 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-23 18:22:16,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:16,184 INFO L93 Difference]: Finished difference Result 404 states and 556 transitions. [2020-10-23 18:22:16,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 18:22:16,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-10-23 18:22:16,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:16,191 INFO L225 Difference]: With dead ends: 404 [2020-10-23 18:22:16,192 INFO L226 Difference]: Without dead ends: 345 [2020-10-23 18:22:16,193 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:22:16,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2020-10-23 18:22:16,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 302. [2020-10-23 18:22:16,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-10-23 18:22:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 412 transitions. [2020-10-23 18:22:16,251 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 412 transitions. Word has length 29 [2020-10-23 18:22:16,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:16,252 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 412 transitions. [2020-10-23 18:22:16,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 18:22:16,252 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 412 transitions. [2020-10-23 18:22:16,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-23 18:22:16,260 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:16,260 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] [2020-10-23 18:22:16,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 18:22:16,261 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:16,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:16,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1068199997, now seen corresponding path program 1 times [2020-10-23 18:22:16,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:16,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365481882] [2020-10-23 18:22:16,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:16,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:16,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:16,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:16,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365481882] [2020-10-23 18:22:16,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:16,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 18:22:16,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019075442] [2020-10-23 18:22:16,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 18:22:16,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:16,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 18:22:16,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-23 18:22:16,648 INFO L87 Difference]: Start difference. First operand 302 states and 412 transitions. Second operand 6 states. [2020-10-23 18:22:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:17,788 INFO L93 Difference]: Finished difference Result 481 states and 638 transitions. [2020-10-23 18:22:17,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 18:22:17,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-10-23 18:22:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:17,795 INFO L225 Difference]: With dead ends: 481 [2020-10-23 18:22:17,796 INFO L226 Difference]: Without dead ends: 364 [2020-10-23 18:22:17,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:22:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2020-10-23 18:22:17,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 342. [2020-10-23 18:22:17,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2020-10-23 18:22:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 463 transitions. [2020-10-23 18:22:17,866 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 463 transitions. Word has length 29 [2020-10-23 18:22:17,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:17,866 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 463 transitions. [2020-10-23 18:22:17,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 18:22:17,866 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 463 transitions. [2020-10-23 18:22:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-23 18:22:17,878 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:17,879 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, 1, 1] [2020-10-23 18:22:17,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 18:22:17,879 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:17,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:17,880 INFO L82 PathProgramCache]: Analyzing trace with hash -397096216, now seen corresponding path program 1 times [2020-10-23 18:22:17,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:17,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096272959] [2020-10-23 18:22:17,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:18,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:18,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:18,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:18,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:18,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096272959] [2020-10-23 18:22:18,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:18,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 18:22:18,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263004844] [2020-10-23 18:22:18,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 18:22:18,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:18,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 18:22:18,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-23 18:22:18,216 INFO L87 Difference]: Start difference. First operand 342 states and 463 transitions. Second operand 6 states. [2020-10-23 18:22:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:19,326 INFO L93 Difference]: Finished difference Result 346 states and 466 transitions. [2020-10-23 18:22:19,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 18:22:19,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2020-10-23 18:22:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:19,330 INFO L225 Difference]: With dead ends: 346 [2020-10-23 18:22:19,330 INFO L226 Difference]: Without dead ends: 341 [2020-10-23 18:22:19,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-23 18:22:19,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-10-23 18:22:19,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2020-10-23 18:22:19,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-10-23 18:22:19,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 460 transitions. [2020-10-23 18:22:19,365 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 460 transitions. Word has length 39 [2020-10-23 18:22:19,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:19,365 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 460 transitions. [2020-10-23 18:22:19,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 18:22:19,365 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 460 transitions. [2020-10-23 18:22:19,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-10-23 18:22:19,368 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:19,368 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:19,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 18:22:19,368 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:19,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:19,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1947652478, now seen corresponding path program 1 times [2020-10-23 18:22:19,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:19,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822332693] [2020-10-23 18:22:19,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:19,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:19,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:19,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:19,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:22:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:19,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822332693] [2020-10-23 18:22:19,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:19,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 18:22:19,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903774281] [2020-10-23 18:22:19,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 18:22:19,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:19,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 18:22:19,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:22:19,644 INFO L87 Difference]: Start difference. First operand 341 states and 460 transitions. Second operand 8 states. [2020-10-23 18:22:21,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:21,308 INFO L93 Difference]: Finished difference Result 388 states and 511 transitions. [2020-10-23 18:22:21,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 18:22:21,310 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-10-23 18:22:21,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:21,312 INFO L225 Difference]: With dead ends: 388 [2020-10-23 18:22:21,313 INFO L226 Difference]: Without dead ends: 321 [2020-10-23 18:22:21,314 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:22:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-10-23 18:22:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 302. [2020-10-23 18:22:21,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-10-23 18:22:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 403 transitions. [2020-10-23 18:22:21,359 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 403 transitions. Word has length 47 [2020-10-23 18:22:21,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:21,361 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 403 transitions. [2020-10-23 18:22:21,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 18:22:21,361 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 403 transitions. [2020-10-23 18:22:21,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-23 18:22:21,363 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:21,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:21,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 18:22:21,364 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:21,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:21,365 INFO L82 PathProgramCache]: Analyzing trace with hash -789486523, now seen corresponding path program 1 times [2020-10-23 18:22:21,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:21,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071116279] [2020-10-23 18:22:21,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:21,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:21,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:21,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:21,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:22:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:21,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:22:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:21,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071116279] [2020-10-23 18:22:21,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:21,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 18:22:21,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889111339] [2020-10-23 18:22:21,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 18:22:21,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:21,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 18:22:21,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:22:21,868 INFO L87 Difference]: Start difference. First operand 302 states and 403 transitions. Second operand 12 states. [2020-10-23 18:22:23,170 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2020-10-23 18:22:23,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:23,375 INFO L93 Difference]: Finished difference Result 330 states and 433 transitions. [2020-10-23 18:22:23,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 18:22:23,376 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2020-10-23 18:22:23,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:23,379 INFO L225 Difference]: With dead ends: 330 [2020-10-23 18:22:23,379 INFO L226 Difference]: Without dead ends: 324 [2020-10-23 18:22:23,380 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2020-10-23 18:22:23,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-10-23 18:22:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 316. [2020-10-23 18:22:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2020-10-23 18:22:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 419 transitions. [2020-10-23 18:22:23,423 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 419 transitions. Word has length 46 [2020-10-23 18:22:23,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:23,425 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 419 transitions. [2020-10-23 18:22:23,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 18:22:23,425 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 419 transitions. [2020-10-23 18:22:23,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-10-23 18:22:23,427 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:23,427 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:23,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 18:22:23,428 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:23,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:23,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1873050503, now seen corresponding path program 1 times [2020-10-23 18:22:23,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:23,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961854655] [2020-10-23 18:22:23,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:23,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:23,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:23,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:23,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:22:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:23,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:22:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:23,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961854655] [2020-10-23 18:22:23,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:23,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 18:22:23,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703758339] [2020-10-23 18:22:23,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 18:22:23,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:23,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 18:22:23,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:22:23,890 INFO L87 Difference]: Start difference. First operand 316 states and 419 transitions. Second operand 12 states. [2020-10-23 18:22:25,353 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2020-10-23 18:22:25,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:25,625 INFO L93 Difference]: Finished difference Result 330 states and 432 transitions. [2020-10-23 18:22:25,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 18:22:25,627 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2020-10-23 18:22:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:25,629 INFO L225 Difference]: With dead ends: 330 [2020-10-23 18:22:25,629 INFO L226 Difference]: Without dead ends: 324 [2020-10-23 18:22:25,634 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2020-10-23 18:22:25,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-10-23 18:22:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 317. [2020-10-23 18:22:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2020-10-23 18:22:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 420 transitions. [2020-10-23 18:22:25,687 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 420 transitions. Word has length 47 [2020-10-23 18:22:25,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:25,687 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 420 transitions. [2020-10-23 18:22:25,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 18:22:25,687 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 420 transitions. [2020-10-23 18:22:25,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-10-23 18:22:25,689 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:25,689 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:25,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 18:22:25,690 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:25,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:25,691 INFO L82 PathProgramCache]: Analyzing trace with hash -188257329, now seen corresponding path program 1 times [2020-10-23 18:22:25,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:25,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661608710] [2020-10-23 18:22:25,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:25,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:25,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:25,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:25,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:22:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:25,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:22:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:25,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661608710] [2020-10-23 18:22:25,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:25,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 18:22:25,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287333892] [2020-10-23 18:22:25,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 18:22:25,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:25,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 18:22:25,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:22:25,962 INFO L87 Difference]: Start difference. First operand 317 states and 420 transitions. Second operand 8 states. [2020-10-23 18:22:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:27,036 INFO L93 Difference]: Finished difference Result 332 states and 438 transitions. [2020-10-23 18:22:27,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 18:22:27,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2020-10-23 18:22:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:27,038 INFO L225 Difference]: With dead ends: 332 [2020-10-23 18:22:27,038 INFO L226 Difference]: Without dead ends: 103 [2020-10-23 18:22:27,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:22:27,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-23 18:22:27,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-10-23 18:22:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-23 18:22:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2020-10-23 18:22:27,053 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 48 [2020-10-23 18:22:27,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:27,053 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2020-10-23 18:22:27,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 18:22:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2020-10-23 18:22:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-23 18:22:27,054 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:27,054 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:27,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 18:22:27,055 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:27,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:27,055 INFO L82 PathProgramCache]: Analyzing trace with hash -423326175, now seen corresponding path program 1 times [2020-10-23 18:22:27,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:27,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320355973] [2020-10-23 18:22:27,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:27,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:27,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:27,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:27,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:22:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:27,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:27,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-23 18:22:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:27,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320355973] [2020-10-23 18:22:27,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:27,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 18:22:27,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865488597] [2020-10-23 18:22:27,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 18:22:27,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:27,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 18:22:27,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:22:27,302 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 8 states. [2020-10-23 18:22:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:27,822 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2020-10-23 18:22:27,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 18:22:27,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-10-23 18:22:27,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:27,824 INFO L225 Difference]: With dead ends: 132 [2020-10-23 18:22:27,824 INFO L226 Difference]: Without dead ends: 101 [2020-10-23 18:22:27,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:22:27,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-23 18:22:27,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-23 18:22:27,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-23 18:22:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2020-10-23 18:22:27,839 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 54 [2020-10-23 18:22:27,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:27,839 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2020-10-23 18:22:27,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 18:22:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2020-10-23 18:22:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-10-23 18:22:27,840 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:27,840 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:27,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 18:22:27,841 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:27,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:27,841 INFO L82 PathProgramCache]: Analyzing trace with hash 66580976, now seen corresponding path program 1 times [2020-10-23 18:22:27,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:27,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008661194] [2020-10-23 18:22:27,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:27,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:22:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:28,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008661194] [2020-10-23 18:22:28,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:28,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 18:22:28,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50781450] [2020-10-23 18:22:28,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 18:22:28,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:28,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 18:22:28,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:22:28,177 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 11 states. [2020-10-23 18:22:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:28,531 INFO L93 Difference]: Finished difference Result 154 states and 179 transitions. [2020-10-23 18:22:28,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 18:22:28,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2020-10-23 18:22:28,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:28,533 INFO L225 Difference]: With dead ends: 154 [2020-10-23 18:22:28,533 INFO L226 Difference]: Without dead ends: 112 [2020-10-23 18:22:28,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:22:28,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-23 18:22:28,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-10-23 18:22:28,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-23 18:22:28,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2020-10-23 18:22:28,548 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 58 [2020-10-23 18:22:28,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:28,548 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2020-10-23 18:22:28,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 18:22:28,548 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2020-10-23 18:22:28,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-10-23 18:22:28,549 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:28,549 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:28,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 18:22:28,549 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:28,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:28,550 INFO L82 PathProgramCache]: Analyzing trace with hash 836849471, now seen corresponding path program 1 times [2020-10-23 18:22:28,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:28,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928164233] [2020-10-23 18:22:28,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:22:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:28,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928164233] [2020-10-23 18:22:28,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:28,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 18:22:28,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446495439] [2020-10-23 18:22:28,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 18:22:28,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:28,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 18:22:28,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:22:28,842 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 11 states. [2020-10-23 18:22:29,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:29,257 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2020-10-23 18:22:29,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 18:22:29,258 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2020-10-23 18:22:29,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:29,259 INFO L225 Difference]: With dead ends: 118 [2020-10-23 18:22:29,260 INFO L226 Difference]: Without dead ends: 110 [2020-10-23 18:22:29,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2020-10-23 18:22:29,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-23 18:22:29,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2020-10-23 18:22:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-23 18:22:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2020-10-23 18:22:29,275 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 58 [2020-10-23 18:22:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:29,275 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2020-10-23 18:22:29,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 18:22:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2020-10-23 18:22:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-23 18:22:29,276 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:29,277 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:29,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 18:22:29,277 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:29,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:29,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1738148909, now seen corresponding path program 1 times [2020-10-23 18:22:29,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:29,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053971605] [2020-10-23 18:22:29,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:29,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:29,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:29,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:29,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:22:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:29,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:29,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:29,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:29,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053971605] [2020-10-23 18:22:29,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:29,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 18:22:29,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043956737] [2020-10-23 18:22:29,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 18:22:29,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:29,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 18:22:29,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:22:29,538 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand 8 states. [2020-10-23 18:22:29,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:29,934 INFO L93 Difference]: Finished difference Result 206 states and 232 transitions. [2020-10-23 18:22:29,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 18:22:29,934 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2020-10-23 18:22:29,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:29,936 INFO L225 Difference]: With dead ends: 206 [2020-10-23 18:22:29,936 INFO L226 Difference]: Without dead ends: 198 [2020-10-23 18:22:29,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:22:29,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-10-23 18:22:29,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 185. [2020-10-23 18:22:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-10-23 18:22:29,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 211 transitions. [2020-10-23 18:22:29,968 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 211 transitions. Word has length 59 [2020-10-23 18:22:29,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:29,970 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 211 transitions. [2020-10-23 18:22:29,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 18:22:29,970 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 211 transitions. [2020-10-23 18:22:29,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-23 18:22:29,971 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:29,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:29,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 18:22:29,972 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:29,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:29,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1747471761, now seen corresponding path program 1 times [2020-10-23 18:22:29,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:29,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448556424] [2020-10-23 18:22:29,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:22:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:30,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448556424] [2020-10-23 18:22:30,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:30,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:22:30,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870102597] [2020-10-23 18:22:30,287 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:22:30,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:30,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:22:30,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:22:30,290 INFO L87 Difference]: Start difference. First operand 185 states and 211 transitions. Second operand 10 states. [2020-10-23 18:22:30,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:30,523 INFO L93 Difference]: Finished difference Result 250 states and 286 transitions. [2020-10-23 18:22:30,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 18:22:30,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2020-10-23 18:22:30,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:30,525 INFO L225 Difference]: With dead ends: 250 [2020-10-23 18:22:30,525 INFO L226 Difference]: Without dead ends: 173 [2020-10-23 18:22:30,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:22:30,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-10-23 18:22:30,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2020-10-23 18:22:30,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-10-23 18:22:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 193 transitions. [2020-10-23 18:22:30,545 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 193 transitions. Word has length 59 [2020-10-23 18:22:30,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:30,546 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 193 transitions. [2020-10-23 18:22:30,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:22:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 193 transitions. [2020-10-23 18:22:30,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-23 18:22:30,547 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:30,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:30,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-23 18:22:30,547 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:30,548 INFO L82 PathProgramCache]: Analyzing trace with hash 298750794, now seen corresponding path program 1 times [2020-10-23 18:22:30,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:30,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583656787] [2020-10-23 18:22:30,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:22:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 18:22:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:30,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583656787] [2020-10-23 18:22:30,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:30,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 18:22:30,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816093045] [2020-10-23 18:22:30,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 18:22:30,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:30,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 18:22:30,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:22:30,885 INFO L87 Difference]: Start difference. First operand 173 states and 193 transitions. Second operand 12 states. [2020-10-23 18:22:31,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:31,506 INFO L93 Difference]: Finished difference Result 222 states and 252 transitions. [2020-10-23 18:22:31,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-23 18:22:31,506 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2020-10-23 18:22:31,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:31,510 INFO L225 Difference]: With dead ends: 222 [2020-10-23 18:22:31,510 INFO L226 Difference]: Without dead ends: 157 [2020-10-23 18:22:31,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2020-10-23 18:22:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-10-23 18:22:31,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2020-10-23 18:22:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-10-23 18:22:31,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2020-10-23 18:22:31,536 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 63 [2020-10-23 18:22:31,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:31,537 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2020-10-23 18:22:31,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 18:22:31,537 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2020-10-23 18:22:31,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-23 18:22:31,544 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:31,544 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:31,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-23 18:22:31,545 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:31,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:31,545 INFO L82 PathProgramCache]: Analyzing trace with hash -622762419, now seen corresponding path program 1 times [2020-10-23 18:22:31,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:31,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320816926] [2020-10-23 18:22:31,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:31,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:31,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:31,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:31,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:22:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:31,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:31,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:31,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 18:22:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:31,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320816926] [2020-10-23 18:22:31,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:31,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:22:31,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88460068] [2020-10-23 18:22:31,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:22:31,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:31,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:22:31,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:22:31,832 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand 9 states. [2020-10-23 18:22:32,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:32,174 INFO L93 Difference]: Finished difference Result 218 states and 246 transitions. [2020-10-23 18:22:32,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-23 18:22:32,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-10-23 18:22:32,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:32,177 INFO L225 Difference]: With dead ends: 218 [2020-10-23 18:22:32,177 INFO L226 Difference]: Without dead ends: 169 [2020-10-23 18:22:32,177 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:22:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-10-23 18:22:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 163. [2020-10-23 18:22:32,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-23 18:22:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 179 transitions. [2020-10-23 18:22:32,200 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 179 transitions. Word has length 65 [2020-10-23 18:22:32,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:32,200 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 179 transitions. [2020-10-23 18:22:32,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:22:32,201 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 179 transitions. [2020-10-23 18:22:32,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-23 18:22:32,202 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:32,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:32,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-23 18:22:32,202 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:32,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:32,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1633879669, now seen corresponding path program 1 times [2020-10-23 18:22:32,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:32,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193548189] [2020-10-23 18:22:32,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:32,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:32,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:32,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:32,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:22:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:32,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:32,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:32,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 18:22:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:32,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193548189] [2020-10-23 18:22:32,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:32,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:22:32,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153784081] [2020-10-23 18:22:32,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:22:32,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:32,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:22:32,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:22:32,481 INFO L87 Difference]: Start difference. First operand 163 states and 179 transitions. Second operand 9 states. [2020-10-23 18:22:32,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:32,778 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2020-10-23 18:22:32,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 18:22:32,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-10-23 18:22:32,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:32,780 INFO L225 Difference]: With dead ends: 185 [2020-10-23 18:22:32,781 INFO L226 Difference]: Without dead ends: 179 [2020-10-23 18:22:32,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:22:32,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-10-23 18:22:32,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 167. [2020-10-23 18:22:32,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-10-23 18:22:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 182 transitions. [2020-10-23 18:22:32,802 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 182 transitions. Word has length 65 [2020-10-23 18:22:32,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:32,802 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 182 transitions. [2020-10-23 18:22:32,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:22:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 182 transitions. [2020-10-23 18:22:32,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-23 18:22:32,804 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:32,804 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:32,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-23 18:22:32,804 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:32,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:32,805 INFO L82 PathProgramCache]: Analyzing trace with hash 859980764, now seen corresponding path program 1 times [2020-10-23 18:22:32,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:32,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741586088] [2020-10-23 18:22:32,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:32,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:32,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:33,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:33,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:22:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:33,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:33,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:33,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 18:22:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:33,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741586088] [2020-10-23 18:22:33,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:33,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 18:22:33,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83919313] [2020-10-23 18:22:33,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 18:22:33,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:33,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 18:22:33,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:22:33,113 INFO L87 Difference]: Start difference. First operand 167 states and 182 transitions. Second operand 12 states. [2020-10-23 18:22:33,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:33,435 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2020-10-23 18:22:33,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 18:22:33,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2020-10-23 18:22:33,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:33,437 INFO L225 Difference]: With dead ends: 184 [2020-10-23 18:22:33,437 INFO L226 Difference]: Without dead ends: 176 [2020-10-23 18:22:33,438 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-23 18:22:33,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-23 18:22:33,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 167. [2020-10-23 18:22:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-10-23 18:22:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2020-10-23 18:22:33,458 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 65 [2020-10-23 18:22:33,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:33,459 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2020-10-23 18:22:33,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 18:22:33,459 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2020-10-23 18:22:33,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-23 18:22:33,460 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:33,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:33,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-23 18:22:33,460 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:33,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:33,461 INFO L82 PathProgramCache]: Analyzing trace with hash 2107663365, now seen corresponding path program 1 times [2020-10-23 18:22:33,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:33,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690837563] [2020-10-23 18:22:33,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:33,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:33,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:33,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:33,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:22:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:33,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:33,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:33,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 18:22:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:33,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690837563] [2020-10-23 18:22:33,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:33,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 18:22:33,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754128942] [2020-10-23 18:22:33,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 18:22:33,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:33,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 18:22:33,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:22:33,829 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 12 states. [2020-10-23 18:22:34,205 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-23 18:22:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:34,731 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2020-10-23 18:22:34,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 18:22:34,731 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2020-10-23 18:22:34,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:34,733 INFO L225 Difference]: With dead ends: 171 [2020-10-23 18:22:34,733 INFO L226 Difference]: Without dead ends: 145 [2020-10-23 18:22:34,734 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2020-10-23 18:22:34,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-23 18:22:34,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2020-10-23 18:22:34,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-10-23 18:22:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2020-10-23 18:22:34,761 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 66 [2020-10-23 18:22:34,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:34,762 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2020-10-23 18:22:34,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 18:22:34,762 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2020-10-23 18:22:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-23 18:22:34,763 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:34,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:34,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-23 18:22:34,763 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:34,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:34,764 INFO L82 PathProgramCache]: Analyzing trace with hash -295561405, now seen corresponding path program 1 times [2020-10-23 18:22:34,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:34,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677249464] [2020-10-23 18:22:34,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:34,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:34,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:34,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:34,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:22:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:34,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:34,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:35,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 18:22:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:35,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677249464] [2020-10-23 18:22:35,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:35,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:22:35,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215163642] [2020-10-23 18:22:35,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:22:35,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:35,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:22:35,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:22:35,025 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 9 states. [2020-10-23 18:22:35,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:35,301 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2020-10-23 18:22:35,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 18:22:35,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2020-10-23 18:22:35,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:35,303 INFO L225 Difference]: With dead ends: 171 [2020-10-23 18:22:35,303 INFO L226 Difference]: Without dead ends: 138 [2020-10-23 18:22:35,303 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:22:35,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-10-23 18:22:35,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2020-10-23 18:22:35,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-10-23 18:22:35,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2020-10-23 18:22:35,321 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 66 [2020-10-23 18:22:35,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:35,321 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2020-10-23 18:22:35,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:22:35,321 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2020-10-23 18:22:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-23 18:22:35,322 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:35,322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:35,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-23 18:22:35,322 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:35,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:35,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1830425452, now seen corresponding path program 1 times [2020-10-23 18:22:35,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:35,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643716754] [2020-10-23 18:22:35,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:35,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:35,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:35,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:35,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:22:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:35,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:35,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:35,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 18:22:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:35,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643716754] [2020-10-23 18:22:35,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:35,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 18:22:35,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687353349] [2020-10-23 18:22:35,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 18:22:35,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:35,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 18:22:35,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:22:35,651 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand 12 states. [2020-10-23 18:22:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:36,021 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2020-10-23 18:22:36,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 18:22:36,022 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2020-10-23 18:22:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:36,023 INFO L225 Difference]: With dead ends: 150 [2020-10-23 18:22:36,023 INFO L226 Difference]: Without dead ends: 138 [2020-10-23 18:22:36,024 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-23 18:22:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-10-23 18:22:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2020-10-23 18:22:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-10-23 18:22:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 141 transitions. [2020-10-23 18:22:36,042 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 141 transitions. Word has length 66 [2020-10-23 18:22:36,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:36,043 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 141 transitions. [2020-10-23 18:22:36,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 18:22:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 141 transitions. [2020-10-23 18:22:36,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-23 18:22:36,044 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:22:36,044 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:22:36,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-23 18:22:36,044 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:22:36,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:22:36,044 INFO L82 PathProgramCache]: Analyzing trace with hash 281047691, now seen corresponding path program 1 times [2020-10-23 18:22:36,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:22:36,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649442973] [2020-10-23 18:22:36,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:22:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:36,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:22:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:36,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:22:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:36,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:22:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:36,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:22:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:36,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:22:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:36,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:22:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:36,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 18:22:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:36,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-10-23 18:22:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:22:36,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:22:36,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649442973] [2020-10-23 18:22:36,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:22:36,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 18:22:36,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801904297] [2020-10-23 18:22:36,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 18:22:36,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:22:36,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 18:22:36,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:22:36,347 INFO L87 Difference]: Start difference. First operand 138 states and 141 transitions. Second operand 11 states. [2020-10-23 18:22:36,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:22:36,617 INFO L93 Difference]: Finished difference Result 138 states and 141 transitions. [2020-10-23 18:22:36,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 18:22:36,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2020-10-23 18:22:36,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:22:36,618 INFO L225 Difference]: With dead ends: 138 [2020-10-23 18:22:36,618 INFO L226 Difference]: Without dead ends: 0 [2020-10-23 18:22:36,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-10-23 18:22:36,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-23 18:22:36,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-23 18:22:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-23 18:22:36,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-23 18:22:36,620 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2020-10-23 18:22:36,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:22:36,620 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-23 18:22:36,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 18:22:36,620 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-23 18:22:36,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-23 18:22:36,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-23 18:22:36,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-23 18:22:37,747 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 56 [2020-10-23 18:22:37,968 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-10-23 18:22:38,129 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2020-10-23 18:22:38,471 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 53 [2020-10-23 18:22:38,589 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-10-23 18:22:38,796 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2020-10-23 18:22:39,245 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 30 [2020-10-23 18:22:39,440 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 64 [2020-10-23 18:22:39,768 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 50 [2020-10-23 18:22:40,040 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 36 [2020-10-23 18:22:40,267 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2020-10-23 18:22:40,752 WARN L193 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2020-10-23 18:22:41,010 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2020-10-23 18:22:41,224 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 51 [2020-10-23 18:22:41,357 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-10-23 18:22:41,785 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 53 [2020-10-23 18:22:42,098 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 68 [2020-10-23 18:22:42,225 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-10-23 18:22:42,634 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 56 [2020-10-23 18:22:42,755 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2020-10-23 18:22:42,973 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 51 [2020-10-23 18:22:43,189 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-10-23 18:22:43,501 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 38 [2020-10-23 18:22:43,774 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 36 [2020-10-23 18:22:44,179 WARN L193 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 52 [2020-10-23 18:22:44,299 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2020-10-23 18:22:44,758 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2020-10-23 18:22:44,912 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-10-23 18:22:45,236 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 51 [2020-10-23 18:22:45,451 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-10-23 18:22:45,585 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2020-10-23 18:22:45,779 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-10-23 18:22:45,952 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-10-23 18:22:46,160 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 76 [2020-10-23 18:22:46,284 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-10-23 18:22:46,412 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-10-23 18:22:46,628 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-10-23 18:22:46,834 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-10-23 18:22:46,959 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-10-23 18:22:47,250 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 51 [2020-10-23 18:22:47,446 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2020-10-23 18:22:47,571 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-10-23 18:22:47,794 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-10-23 18:22:48,196 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 49 [2020-10-23 18:22:48,414 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-10-23 18:22:48,682 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 57 [2020-10-23 18:22:48,940 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2020-10-23 18:22:49,242 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 36 [2020-10-23 18:22:49,362 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2020-10-23 18:22:49,487 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-10-23 18:22:49,492 INFO L274 CegarLoopResult]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2020-10-23 18:22:49,492 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-23 18:22:49,492 INFO L274 CegarLoopResult]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2020-10-23 18:22:49,493 INFO L274 CegarLoopResult]: For program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-23 18:22:49,493 INFO L270 CegarLoopResult]: At program point L624(line 624) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= 5 ~MPR1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (= ~s~0 ~NP~0))) [2020-10-23 18:22:49,493 INFO L270 CegarLoopResult]: At program point KbFilter_CompleteENTRY(lines 618 628) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= 5 ~MPR1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (= ~s~0 ~NP~0))) [2020-10-23 18:22:49,493 INFO L274 CegarLoopResult]: For program point L624-1(line 624) no Hoare annotation was computed. [2020-10-23 18:22:49,493 INFO L274 CegarLoopResult]: For program point KbFilter_CompleteFINAL(lines 618 628) no Hoare annotation was computed. [2020-10-23 18:22:49,493 INFO L274 CegarLoopResult]: For program point KbFilter_CompleteEXIT(lines 618 628) no Hoare annotation was computed. [2020-10-23 18:22:49,494 INFO L270 CegarLoopResult]: At program point KeSetEventENTRY(lines 568 575) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= 5 ~MPR1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (= ~s~0 ~NP~0))) [2020-10-23 18:22:49,494 INFO L274 CegarLoopResult]: For program point KeSetEventFINAL(lines 568 575) no Hoare annotation was computed. [2020-10-23 18:22:49,494 INFO L274 CegarLoopResult]: For program point KeSetEventEXIT(lines 568 575) no Hoare annotation was computed. [2020-10-23 18:22:49,494 INFO L274 CegarLoopResult]: For program point L700(lines 700 729) no Hoare annotation was computed. [2020-10-23 18:22:49,494 INFO L274 CegarLoopResult]: For program point KbFilter_PowerEXIT(lines 689 744) no Hoare annotation was computed. [2020-10-23 18:22:49,494 INFO L274 CegarLoopResult]: For program point L709(lines 709 726) no Hoare annotation was computed. [2020-10-23 18:22:49,494 INFO L270 CegarLoopResult]: At program point L740(line 740) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (= ~SKIP1~0 ~s~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,494 INFO L270 CegarLoopResult]: At program point KbFilter_PowerENTRY(lines 689 744) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,494 INFO L274 CegarLoopResult]: For program point L740-1(line 740) no Hoare annotation was computed. [2020-10-23 18:22:49,494 INFO L274 CegarLoopResult]: For program point L703(lines 703 728) no Hoare annotation was computed. [2020-10-23 18:22:49,495 INFO L270 CegarLoopResult]: At program point L734(line 734) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,495 INFO L270 CegarLoopResult]: At program point L701(lines 700 729) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,495 INFO L274 CegarLoopResult]: For program point L734-1(lines 730 736) no Hoare annotation was computed. [2020-10-23 18:22:49,495 INFO L270 CegarLoopResult]: At program point L724(lines 699 743) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,495 INFO L274 CegarLoopResult]: For program point KbFilter_PowerFINAL(lines 689 744) no Hoare annotation was computed. [2020-10-23 18:22:49,495 INFO L274 CegarLoopResult]: For program point L706(lines 706 727) no Hoare annotation was computed. [2020-10-23 18:22:49,495 INFO L274 CegarLoopResult]: For program point stub_driver_initEXIT(lines 43 56) no Hoare annotation was computed. [2020-10-23 18:22:49,495 INFO L270 CegarLoopResult]: At program point stub_driver_initENTRY(lines 43 56) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (= |old(~pended~0)| 1) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-10-23 18:22:49,495 INFO L274 CegarLoopResult]: For program point stub_driver_initFINAL(lines 43 56) no Hoare annotation was computed. [2020-10-23 18:22:49,495 INFO L274 CegarLoopResult]: For program point _BLAST_initFINAL(lines 57 78) no Hoare annotation was computed. [2020-10-23 18:22:49,495 INFO L270 CegarLoopResult]: At program point _BLAST_initENTRY(lines 57 78) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~MPR3~0 |old(~MPR3~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~DC~0 |old(~DC~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-10-23 18:22:49,496 INFO L274 CegarLoopResult]: For program point _BLAST_initEXIT(lines 57 78) no Hoare annotation was computed. [2020-10-23 18:22:49,496 INFO L277 CegarLoopResult]: At program point errorFnENTRY(lines 1009 1016) the Hoare annotation is: true [2020-10-23 18:22:49,496 INFO L274 CegarLoopResult]: For program point errorFnFINAL(lines 1009 1016) no Hoare annotation was computed. [2020-10-23 18:22:49,496 INFO L274 CegarLoopResult]: For program point errorFnEXIT(lines 1009 1016) no Hoare annotation was computed. [2020-10-23 18:22:49,496 INFO L274 CegarLoopResult]: For program point L1013(line 1013) no Hoare annotation was computed. [2020-10-23 18:22:49,496 INFO L274 CegarLoopResult]: For program point L415(lines 415 419) no Hoare annotation was computed. [2020-10-23 18:22:49,496 INFO L274 CegarLoopResult]: For program point mainEXIT(lines 295 466) no Hoare annotation was computed. [2020-10-23 18:22:49,496 INFO L270 CegarLoopResult]: At program point L374(lines 373 408) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= main_~status~1 0) (= 2 ~DC~0) (not (= ~pended~0 1)))) [2020-10-23 18:22:49,496 INFO L274 CegarLoopResult]: For program point L432(lines 432 459) no Hoare annotation was computed. [2020-10-23 18:22:49,496 INFO L274 CegarLoopResult]: For program point L358(lines 358 411) no Hoare annotation was computed. [2020-10-23 18:22:49,496 INFO L274 CegarLoopResult]: For program point L449(lines 449 457) no Hoare annotation was computed. [2020-10-23 18:22:49,496 INFO L270 CegarLoopResult]: At program point L441(lines 432 459) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (<= ~compRegistered~0 0) (= ~compRegistered~0 1))) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-10-23 18:22:49,496 INFO L274 CegarLoopResult]: For program point L433(lines 433 439) no Hoare annotation was computed. [2020-10-23 18:22:49,497 INFO L274 CegarLoopResult]: For program point L400(line 400) no Hoare annotation was computed. [2020-10-23 18:22:49,497 INFO L270 CegarLoopResult]: At program point L359(lines 358 411) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= main_~status~1 0) (= 2 ~DC~0) (not (= ~pended~0 1)))) [2020-10-23 18:22:49,497 INFO L274 CegarLoopResult]: For program point L450(lines 450 452) no Hoare annotation was computed. [2020-10-23 18:22:49,497 INFO L270 CegarLoopResult]: At program point L376(lines 375 408) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= main_~status~1 0) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-10-23 18:22:49,497 INFO L274 CegarLoopResult]: For program point L434(lines 434 436) no Hoare annotation was computed. [2020-10-23 18:22:49,497 INFO L274 CegarLoopResult]: For program point L368(lines 368 409) no Hoare annotation was computed. [2020-10-23 18:22:49,498 INFO L274 CegarLoopResult]: For program point mainFINAL(lines 295 466) no Hoare annotation was computed. [2020-10-23 18:22:49,498 INFO L274 CegarLoopResult]: For program point L385(line 385) no Hoare annotation was computed. [2020-10-23 18:22:49,499 INFO L270 CegarLoopResult]: At program point mainENTRY(lines 295 466) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~Executive~0)| ~Executive~0) (= ~MPR3~0 |old(~MPR3~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~DC~0 |old(~DC~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0) (= |old(~DevicePowerState~0)| ~DevicePowerState~0) (= ~myStatus~0 |old(~myStatus~0)|))) [2020-10-23 18:22:49,499 INFO L274 CegarLoopResult]: For program point L443(lines 443 447) no Hoare annotation was computed. [2020-10-23 18:22:49,499 INFO L274 CegarLoopResult]: For program point L344(lines 330 413) no Hoare annotation was computed. [2020-10-23 18:22:49,499 INFO L270 CegarLoopResult]: At program point L369(lines 368 409) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= main_~status~1 0) (= 2 ~DC~0) (not (= ~pended~0 1)))) [2020-10-23 18:22:49,499 INFO L270 CegarLoopResult]: At program point L328(line 328) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= ~MPR3~0 ~s~0) (<= ~s~0 ~DC~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= main_~status~1 0) (<= ~DC~0 ~s~0) (not (= ~pended~0 1)))) [2020-10-23 18:22:49,499 INFO L274 CegarLoopResult]: For program point L328-1(lines 324 465) no Hoare annotation was computed. [2020-10-23 18:22:49,499 INFO L274 CegarLoopResult]: For program point L353(lines 353 412) no Hoare annotation was computed. [2020-10-23 18:22:49,499 INFO L274 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2020-10-23 18:22:49,500 INFO L270 CegarLoopResult]: At program point L354(lines 353 412) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= main_~status~1 0) (= 2 ~DC~0) (not (= ~pended~0 1)))) [2020-10-23 18:22:49,500 INFO L270 CegarLoopResult]: At program point L445(line 445) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-10-23 18:22:49,500 INFO L270 CegarLoopResult]: At program point L429(lines 422 462) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (and (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (<= ~compRegistered~0 0) (= ~compRegistered~0 1))) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-10-23 18:22:49,500 INFO L274 CegarLoopResult]: For program point L363(lines 363 410) no Hoare annotation was computed. [2020-10-23 18:22:49,500 INFO L270 CegarLoopResult]: At program point L330(lines 324 465) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (and (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (<= ~compRegistered~0 0) (= ~compRegistered~0 1))) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-10-23 18:22:49,500 INFO L274 CegarLoopResult]: For program point L454(lines 454 456) no Hoare annotation was computed. [2020-10-23 18:22:49,501 INFO L270 CegarLoopResult]: At program point L421(lines 414 463) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (and (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (<= ~compRegistered~0 0) (= ~compRegistered~0 1))) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-10-23 18:22:49,501 INFO L274 CegarLoopResult]: For program point L380(line 380) no Hoare annotation was computed. [2020-10-23 18:22:49,501 INFO L274 CegarLoopResult]: For program point L339(lines 339 342) no Hoare annotation was computed. [2020-10-23 18:22:49,501 INFO L270 CegarLoopResult]: At program point L339-2(lines 339 342) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= ~NP~0 1) (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= main_~status~1 0) (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= 5 ~MPR1~0))) [2020-10-23 18:22:49,501 INFO L274 CegarLoopResult]: For program point L430(lines 414 463) no Hoare annotation was computed. [2020-10-23 18:22:49,501 INFO L270 CegarLoopResult]: At program point L364(lines 363 410) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= ~NP~0 1) (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= main_~status~1 0) (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= 5 ~MPR1~0))) [2020-10-23 18:22:49,501 INFO L274 CegarLoopResult]: For program point L373(lines 373 408) no Hoare annotation was computed. [2020-10-23 18:22:49,501 INFO L274 CegarLoopResult]: For program point L431(lines 431 460) no Hoare annotation was computed. [2020-10-23 18:22:49,501 INFO L274 CegarLoopResult]: For program point L423(lines 423 427) no Hoare annotation was computed. [2020-10-23 18:22:49,502 INFO L274 CegarLoopResult]: For program point L390(line 390) no Hoare annotation was computed. [2020-10-23 18:22:49,502 INFO L270 CegarLoopResult]: At program point L510(lines 509 526) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (= 2 ~DC~0))) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0)))) (and (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) .cse0 .cse1 .cse2 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (and (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) .cse3) (or .cse0 .cse1 .cse2 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-10-23 18:22:49,502 INFO L274 CegarLoopResult]: For program point L532(lines 532 549) no Hoare annotation was computed. [2020-10-23 18:22:49,502 INFO L270 CegarLoopResult]: At program point IofCallDriverENTRY(lines 481 553) the Hoare annotation is: (let ((.cse2 (= ~pended~0 1)) (.cse3 (not (= 2 ~DC~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse0 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse1 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse5 (not (<= 4 ~SKIP2~0)))) (and (or (and .cse0 .cse1 (= ~s~0 ~NP~0)) (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) .cse2 .cse3 .cse4 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) .cse5) (or .cse2 .cse3 .cse4 (and .cse0 .cse1 (= ~SKIP1~0 ~s~0)) .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-10-23 18:22:49,502 INFO L274 CegarLoopResult]: For program point L495(lines 495 499) no Hoare annotation was computed. [2020-10-23 18:22:49,502 INFO L270 CegarLoopResult]: At program point L524(lines 488 552) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse3 (not (= 2 ~DC~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (not (<= 4 ~SKIP2~0)))) (and (let ((.cse1 (= ~MPR1~0 ~s~0)) (.cse2 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) .cse0 (and .cse1 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse2) (and .cse1 (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse2) .cse3 .cse4 (not (<= 5 ~MPR1~0)) (not (= |old(~s~0)| 1)) (and (<= IofCallDriver_~returnVal2~0 0) .cse1 (<= 0 IofCallDriver_~returnVal2~0) .cse2) (not (= ~NP~0 1)) .cse5)) (or .cse0 .cse3 .cse4 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-10-23 18:22:49,503 INFO L270 CegarLoopResult]: At program point L491(line 491) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (= 2 ~DC~0))) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0)))) (and (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) .cse0 .cse1 .cse2 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) .cse3) (or .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-10-23 18:22:49,503 INFO L274 CegarLoopResult]: For program point L491-1(line 491) no Hoare annotation was computed. [2020-10-23 18:22:49,503 INFO L274 CegarLoopResult]: For program point IofCallDriverFINAL(lines 481 553) no Hoare annotation was computed. [2020-10-23 18:22:49,503 INFO L270 CegarLoopResult]: At program point L512(lines 511 526) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (= 2 ~DC~0))) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0)))) (and (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) .cse0 .cse1 .cse2 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) .cse3 (and (= ~MPR1~0 ~s~0) (= ~setEventCalled~0 1) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or .cse0 .cse1 .cse2 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-10-23 18:22:49,503 INFO L274 CegarLoopResult]: For program point L541(lines 541 548) no Hoare annotation was computed. [2020-10-23 18:22:49,503 INFO L274 CegarLoopResult]: For program point L504(lines 504 527) no Hoare annotation was computed. [2020-10-23 18:22:49,503 INFO L274 CegarLoopResult]: For program point IofCallDriverEXIT(lines 481 553) no Hoare annotation was computed. [2020-10-23 18:22:49,503 INFO L274 CegarLoopResult]: For program point L533(lines 533 539) no Hoare annotation was computed. [2020-10-23 18:22:49,504 INFO L270 CegarLoopResult]: At program point L546(line 546) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (= 2 ~DC~0))) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) .cse0 .cse1 .cse2 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) .cse3))) [2020-10-23 18:22:49,504 INFO L274 CegarLoopResult]: For program point L546-1(lines 528 550) no Hoare annotation was computed. [2020-10-23 18:22:49,504 INFO L274 CegarLoopResult]: For program point L509(lines 509 526) no Hoare annotation was computed. [2020-10-23 18:22:49,504 INFO L270 CegarLoopResult]: At program point L505(lines 504 527) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (= 2 ~DC~0))) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0)))) (and (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) .cse0 .cse1 .cse2 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (and (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) .cse3) (or .cse0 .cse1 .cse2 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-10-23 18:22:49,504 INFO L270 CegarLoopResult]: At program point L497(line 497) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (= 2 ~DC~0))) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) .cse0 .cse1 .cse2 (and (= ~s~0 1) (= ~setEventCalled~0 1) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) .cse3))) [2020-10-23 18:22:49,504 INFO L274 CegarLoopResult]: For program point L489(lines 489 501) no Hoare annotation was computed. [2020-10-23 18:22:49,504 INFO L274 CegarLoopResult]: For program point L489-1(lines 489 501) no Hoare annotation was computed. [2020-10-23 18:22:49,505 INFO L270 CegarLoopResult]: At program point L475(line 475) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (= ~setEventCalled~0 1)) (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-10-23 18:22:49,505 INFO L274 CegarLoopResult]: For program point L475-1(lines 467 480) no Hoare annotation was computed. [2020-10-23 18:22:49,505 INFO L270 CegarLoopResult]: At program point stubMoreProcessingRequiredENTRY(lines 467 480) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (= ~s~0 ~NP~0) (not (= ~setEventCalled~0 1)) (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-10-23 18:22:49,505 INFO L274 CegarLoopResult]: For program point stubMoreProcessingRequiredEXIT(lines 467 480) no Hoare annotation was computed. [2020-10-23 18:22:49,505 INFO L270 CegarLoopResult]: At program point L762(line 762) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,505 INFO L274 CegarLoopResult]: For program point PoCallDriverEXIT(lines 745 821) no Hoare annotation was computed. [2020-10-23 18:22:49,505 INFO L274 CegarLoopResult]: For program point L754(lines 754 766) no Hoare annotation was computed. [2020-10-23 18:22:49,505 INFO L274 CegarLoopResult]: For program point L754-1(lines 754 766) no Hoare annotation was computed. [2020-10-23 18:22:49,505 INFO L270 CegarLoopResult]: At program point L775(lines 774 791) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,506 INFO L274 CegarLoopResult]: For program point L800(lines 800 806) no Hoare annotation was computed. [2020-10-23 18:22:49,506 INFO L274 CegarLoopResult]: For program point PoCallDriverFINAL(lines 745 821) no Hoare annotation was computed. [2020-10-23 18:22:49,506 INFO L270 CegarLoopResult]: At program point PoCallDriverENTRY(lines 745 821) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,506 INFO L274 CegarLoopResult]: For program point L809(lines 809 816) no Hoare annotation was computed. [2020-10-23 18:22:49,506 INFO L274 CegarLoopResult]: For program point L797(lines 797 817) no Hoare annotation was computed. [2020-10-23 18:22:49,506 INFO L274 CegarLoopResult]: For program point L760(lines 760 764) no Hoare annotation was computed. [2020-10-23 18:22:49,506 INFO L270 CegarLoopResult]: At program point L789(lines 753 820) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,506 INFO L270 CegarLoopResult]: At program point L756(line 756) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,506 INFO L274 CegarLoopResult]: For program point L756-1(line 756) no Hoare annotation was computed. [2020-10-23 18:22:49,506 INFO L270 CegarLoopResult]: At program point L814(line 814) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,507 INFO L274 CegarLoopResult]: For program point L814-1(lines 793 818) no Hoare annotation was computed. [2020-10-23 18:22:49,507 INFO L270 CegarLoopResult]: At program point L777(lines 776 791) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,507 INFO L274 CegarLoopResult]: For program point L769(lines 769 792) no Hoare annotation was computed. [2020-10-23 18:22:49,507 INFO L274 CegarLoopResult]: For program point L774(lines 774 791) no Hoare annotation was computed. [2020-10-23 18:22:49,507 INFO L270 CegarLoopResult]: At program point L770(lines 769 792) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,507 INFO L274 CegarLoopResult]: For program point L638(lines 638 656) no Hoare annotation was computed. [2020-10-23 18:22:49,507 INFO L274 CegarLoopResult]: For program point KbFilter_CreateCloseEXIT(lines 629 664) no Hoare annotation was computed. [2020-10-23 18:22:49,507 INFO L270 CegarLoopResult]: At program point L653(lines 641 655) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,507 INFO L270 CegarLoopResult]: At program point L645(lines 638 656) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,508 INFO L274 CegarLoopResult]: For program point L641(lines 641 655) no Hoare annotation was computed. [2020-10-23 18:22:49,508 INFO L270 CegarLoopResult]: At program point KbFilter_CreateCloseENTRY(lines 629 664) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,508 INFO L270 CegarLoopResult]: At program point L660(line 660) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,508 INFO L274 CegarLoopResult]: For program point L660-1(line 660) no Hoare annotation was computed. [2020-10-23 18:22:49,508 INFO L274 CegarLoopResult]: For program point KbFilter_CreateCloseFINAL(lines 629 664) no Hoare annotation was computed. [2020-10-23 18:22:49,508 INFO L274 CegarLoopResult]: For program point L644(lines 644 654) no Hoare annotation was computed. [2020-10-23 18:22:49,508 INFO L274 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-10-23 18:22:49,508 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.offset| |old(#t~string5.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= ~NP~0 |old(~NP~0)|) (= ~DevicePowerState~0 |old(~DevicePowerState~0)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#valid)| |#valid|) (= ~IPC~0 |old(~IPC~0)|) (= |#t~string5.base| |old(#t~string5.base)|) (= ~DC~0 |old(~DC~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= ~Executive~0 |old(~Executive~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= ~MPR3~0 |old(~MPR3~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= ~SKIP1~0 |old(~SKIP1~0)|) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-10-23 18:22:49,509 INFO L274 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-10-23 18:22:49,509 INFO L274 CegarLoopResult]: For program point L956(lines 956 958) no Hoare annotation was computed. [2020-10-23 18:22:49,509 INFO L274 CegarLoopResult]: For program point L956-2(lines 934 971) no Hoare annotation was computed. [2020-10-23 18:22:49,509 INFO L274 CegarLoopResult]: For program point KbFilter_InternIoCtlEXIT(lines 822 1007) no Hoare annotation was computed. [2020-10-23 18:22:49,509 INFO L274 CegarLoopResult]: For program point L940(lines 940 943) no Hoare annotation was computed. [2020-10-23 18:22:49,509 INFO L274 CegarLoopResult]: For program point L903(lines 903 982) no Hoare annotation was computed. [2020-10-23 18:22:49,509 INFO L274 CegarLoopResult]: For program point L924(lines 924 976) no Hoare annotation was computed. [2020-10-23 18:22:49,509 INFO L274 CegarLoopResult]: For program point L891(lines 891 986) no Hoare annotation was computed. [2020-10-23 18:22:49,509 INFO L274 CegarLoopResult]: For program point L883(lines 883 988) no Hoare annotation was computed. [2020-10-23 18:22:49,509 INFO L274 CegarLoopResult]: For program point L875(lines 875 990) no Hoare annotation was computed. [2020-10-23 18:22:49,509 INFO L270 CegarLoopResult]: At program point L1003(line 1003) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,509 INFO L274 CegarLoopResult]: For program point L1003-1(line 1003) no Hoare annotation was computed. [2020-10-23 18:22:49,510 INFO L274 CegarLoopResult]: For program point L896(lines 896 984) no Hoare annotation was computed. [2020-10-23 18:22:49,510 INFO L270 CegarLoopResult]: At program point L892(lines 891 986) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,510 INFO L274 CegarLoopResult]: For program point L917(lines 917 978) no Hoare annotation was computed. [2020-10-23 18:22:49,510 INFO L270 CegarLoopResult]: At program point L884(lines 883 988) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,510 INFO L274 CegarLoopResult]: For program point L934(lines 934 973) no Hoare annotation was computed. [2020-10-23 18:22:49,510 INFO L274 CegarLoopResult]: For program point L959-1(lines 959 961) no Hoare annotation was computed. [2020-10-23 18:22:49,510 INFO L270 CegarLoopResult]: At program point KbFilter_InternIoCtlENTRY(lines 822 1007) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,510 INFO L274 CegarLoopResult]: For program point L910(lines 910 980) no Hoare annotation was computed. [2020-10-23 18:22:49,510 INFO L270 CegarLoopResult]: At program point L972(lines 867 1006) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,511 INFO L270 CegarLoopResult]: At program point L935(lines 875 990) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,511 INFO L270 CegarLoopResult]: At program point L997(line 997) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,511 INFO L274 CegarLoopResult]: For program point L997-1(line 997) no Hoare annotation was computed. [2020-10-23 18:22:49,511 INFO L274 CegarLoopResult]: For program point KbFilter_InternIoCtlFINAL(lines 822 1007) no Hoare annotation was computed. [2020-10-23 18:22:49,511 INFO L274 CegarLoopResult]: For program point L931(lines 931 974) no Hoare annotation was computed. [2020-10-23 18:22:49,511 INFO L274 CegarLoopResult]: For program point L603(lines 603 615) no Hoare annotation was computed. [2020-10-23 18:22:49,511 INFO L274 CegarLoopResult]: For program point KeWaitForSingleObjectEXIT(lines 576 617) no Hoare annotation was computed. [2020-10-23 18:22:49,511 INFO L270 CegarLoopResult]: At program point L589(lines 581 600) the Hoare annotation is: (let ((.cse0 (not (<= 6 ~MPR3~0))) (.cse1 (not (= ~compRegistered~0 1))) (.cse2 (= ~pended~0 1)) (.cse3 (not (= 2 ~DC~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (not (<= 5 ~MPR1~0))) (.cse6 (not (= ~NP~0 1))) (.cse7 (not (<= 4 ~SKIP2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~s~0)| 1)) .cse6 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0)) .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~setEventCalled~0)| 1)) .cse5 .cse6 (not (= ~MPR3~0 |old(~s~0)|)) .cse7))) [2020-10-23 18:22:49,511 INFO L274 CegarLoopResult]: For program point L581(lines 581 600) no Hoare annotation was computed. [2020-10-23 18:22:49,512 INFO L270 CegarLoopResult]: At program point L606(lines 605 615) the Hoare annotation is: (let ((.cse0 (not (<= 6 ~MPR3~0))) (.cse1 (not (= ~compRegistered~0 1))) (.cse2 (= ~pended~0 1)) (.cse3 (not (= 2 ~DC~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (= ~s~0 ~NP~0)) (.cse6 (not (<= 5 ~MPR1~0))) (.cse7 (not (= ~NP~0 1))) (.cse8 (not (<= 4 ~SKIP2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~s~0)| 1)) .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~setEventCalled~0)| 1)) .cse5 .cse6 .cse7 (not (= ~MPR3~0 |old(~s~0)|)) .cse8))) [2020-10-23 18:22:49,512 INFO L274 CegarLoopResult]: For program point KeWaitForSingleObjectFINAL(lines 576 617) no Hoare annotation was computed. [2020-10-23 18:22:49,512 INFO L270 CegarLoopResult]: At program point L604(lines 603 615) the Hoare annotation is: (let ((.cse0 (not (<= 6 ~MPR3~0))) (.cse1 (not (= ~compRegistered~0 1))) (.cse2 (= ~pended~0 1)) (.cse3 (not (= 2 ~DC~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (= ~s~0 ~NP~0)) (.cse6 (not (<= 5 ~MPR1~0))) (.cse7 (not (= ~NP~0 1))) (.cse8 (not (<= 4 ~SKIP2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~s~0)| 1)) .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~setEventCalled~0)| 1)) .cse5 .cse6 .cse7 (not (= ~MPR3~0 |old(~s~0)|)) .cse8))) [2020-10-23 18:22:49,512 INFO L270 CegarLoopResult]: At program point L596(line 596) the Hoare annotation is: (let ((.cse0 (not (<= 6 ~MPR3~0))) (.cse1 (not (= ~compRegistered~0 1))) (.cse2 (= ~pended~0 1)) (.cse3 (not (= 2 ~DC~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (not (<= 5 ~MPR1~0))) (.cse6 (not (= ~NP~0 1))) (.cse7 (not (<= 4 ~SKIP2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~s~0)| 1)) .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~setEventCalled~0)| 1)) .cse5 .cse6 (not (= ~MPR3~0 |old(~s~0)|)) .cse7))) [2020-10-23 18:22:49,512 INFO L274 CegarLoopResult]: For program point L594(lines 594 598) no Hoare annotation was computed. [2020-10-23 18:22:49,512 INFO L274 CegarLoopResult]: For program point L594-1(lines 581 600) no Hoare annotation was computed. [2020-10-23 18:22:49,512 INFO L270 CegarLoopResult]: At program point KeWaitForSingleObjectENTRY(lines 576 617) the Hoare annotation is: (let ((.cse0 (not (<= 6 ~MPR3~0))) (.cse1 (not (= ~compRegistered~0 1))) (.cse2 (= ~pended~0 1)) (.cse3 (not (= 2 ~DC~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (not (<= 5 ~MPR1~0))) (.cse8 (not (= ~NP~0 1))) (.cse6 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse9 (not (<= 4 ~SKIP2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~setEventCalled~0)| 1)) .cse5 (and (= ~MPR3~0 ~s~0) .cse6 .cse7) .cse8 (not (= ~MPR3~0 |old(~s~0)|)) .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~s~0)| 1)) .cse8 (and .cse6 (= ~s~0 ~NP~0) .cse7) .cse9))) [2020-10-23 18:22:49,513 INFO L274 CegarLoopResult]: For program point L582(lines 582 587) no Hoare annotation was computed. [2020-10-23 18:22:49,513 INFO L274 CegarLoopResult]: For program point L562-1(lines 554 567) no Hoare annotation was computed. [2020-10-23 18:22:49,513 INFO L274 CegarLoopResult]: For program point L558(lines 558 564) no Hoare annotation was computed. [2020-10-23 18:22:49,513 INFO L270 CegarLoopResult]: At program point IofCompleteRequestENTRY(lines 554 567) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (= 2 ~DC~0))) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (not (= ~NP~0 |old(~s~0)|))) (.cse5 (not (<= 4 ~SKIP2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~compRegistered~0 0))) (or (not (= ~compRegistered~0 1)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-10-23 18:22:49,513 INFO L274 CegarLoopResult]: For program point IofCompleteRequestEXIT(lines 554 567) no Hoare annotation was computed. [2020-10-23 18:22:49,513 INFO L270 CegarLoopResult]: At program point L562(line 562) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (= 2 ~DC~0))) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (= ~NP~0 |old(~s~0)|))) (.cse4 (not (<= 4 ~SKIP2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~compRegistered~0 0))) (or (not (= ~compRegistered~0 1)) .cse0 .cse1 .cse2 .cse3 .cse4))) [2020-10-23 18:22:49,513 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-23 18:22:49,513 INFO L270 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~MPR3~0 ~s~0) (<= ~s~0 ~DC~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (<= ~DC~0 ~s~0) (not (= ~pended~0 1))) [2020-10-23 18:22:49,514 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-23 18:22:49,514 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-23 18:22:49,514 INFO L270 CegarLoopResult]: At program point KbFilter_DispatchPassThroughENTRY(lines 665 688) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,514 INFO L270 CegarLoopResult]: At program point L684(line 684) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (= ~SKIP1~0 ~s~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,514 INFO L274 CegarLoopResult]: For program point L684-1(line 684) no Hoare annotation was computed. [2020-10-23 18:22:49,514 INFO L274 CegarLoopResult]: For program point KbFilter_DispatchPassThroughFINAL(lines 665 688) no Hoare annotation was computed. [2020-10-23 18:22:49,514 INFO L270 CegarLoopResult]: At program point L678(line 678) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-10-23 18:22:49,514 INFO L274 CegarLoopResult]: For program point L678-1(lines 674 680) no Hoare annotation was computed. [2020-10-23 18:22:49,514 INFO L274 CegarLoopResult]: For program point KbFilter_DispatchPassThroughEXIT(lines 665 688) no Hoare annotation was computed. [2020-10-23 18:22:49,515 INFO L274 CegarLoopResult]: For program point L674(lines 674 680) no Hoare annotation was computed. [2020-10-23 18:22:49,515 INFO L274 CegarLoopResult]: For program point L258-1(lines 254 260) no Hoare annotation was computed. [2020-10-23 18:22:49,515 INFO L274 CegarLoopResult]: For program point L159(lines 159 274) no Hoare annotation was computed. [2020-10-23 18:22:49,515 INFO L274 CegarLoopResult]: For program point L126(lines 126 285) no Hoare annotation was computed. [2020-10-23 18:22:49,515 INFO L270 CegarLoopResult]: At program point L184(line 184) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-10-23 18:22:49,515 INFO L270 CegarLoopResult]: At program point L201(lines 201 203) the Hoare annotation is: (let ((.cse12 (= ~NP~0 1)) (.cse11 (<= 4 ~SKIP2~0)) (.cse1 (= ~pended~0 1)) (.cse10 (= ~compRegistered~0 1)) (.cse13 (<= 5 ~MPR1~0)) (.cse14 (<= 7 ~IPC~0)) (.cse16 (= 2 ~DC~0)) (.cse15 (<= 6 ~MPR3~0))) (let ((.cse0 (not .cse15)) (.cse2 (not .cse16)) (.cse3 (not .cse14)) (.cse4 (and .cse12 .cse14 .cse11 (= ~s~0 ~NP~0) .cse15 (= ~s~0 |old(~s~0)|) .cse16 (not .cse1) .cse10 .cse13)) (.cse5 (not .cse13)) (.cse6 (not (= |old(~s~0)| 1))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not .cse12)) (.cse9 (not .cse11))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and (= ~MPR3~0 ~s~0) (<= 259 KbFilter_PnP_~status~0) (= ~setEventCalled~0 1) (= KbFilter_PnP_~__cil_tmp23~0 259) .cse10)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) (<= (+ ~myStatus~0 1073741637) 0))))) [2020-10-23 18:22:49,515 INFO L274 CegarLoopResult]: For program point L168(lines 168 271) no Hoare annotation was computed. [2020-10-23 18:22:49,516 INFO L274 CegarLoopResult]: For program point L201-1(lines 201 203) no Hoare annotation was computed. [2020-10-23 18:22:49,516 INFO L274 CegarLoopResult]: For program point L135(lines 135 282) no Hoare annotation was computed. [2020-10-23 18:22:49,516 INFO L270 CegarLoopResult]: At program point L218(line 218) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (and (= ~s~0 ~NP~0) (= ~compRegistered~0 1))) [2020-10-23 18:22:49,516 INFO L270 CegarLoopResult]: At program point L243(line 243) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-10-23 18:22:49,516 INFO L274 CegarLoopResult]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2020-10-23 18:22:49,516 INFO L274 CegarLoopResult]: For program point L177(lines 177 189) no Hoare annotation was computed. [2020-10-23 18:22:49,516 INFO L274 CegarLoopResult]: For program point L144(lines 144 279) no Hoare annotation was computed. [2020-10-23 18:22:49,516 INFO L274 CegarLoopResult]: For program point L111(lines 111 290) no Hoare annotation was computed. [2020-10-23 18:22:49,516 INFO L270 CegarLoopResult]: At program point L227(line 227) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-10-23 18:22:49,517 INFO L270 CegarLoopResult]: At program point L194(lines 194 195) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= KbFilter_PnP_~status~0 0) (= ~s~0 1) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~compRegistered~0 1) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-10-23 18:22:49,517 INFO L274 CegarLoopResult]: For program point L227-1(lines 223 229) no Hoare annotation was computed. [2020-10-23 18:22:49,517 INFO L274 CegarLoopResult]: For program point L194-1(lines 194 195) no Hoare annotation was computed. [2020-10-23 18:22:49,517 INFO L274 CegarLoopResult]: For program point L153(lines 153 276) no Hoare annotation was computed. [2020-10-23 18:22:49,517 INFO L274 CegarLoopResult]: For program point L120(lines 120 287) no Hoare annotation was computed. [2020-10-23 18:22:49,517 INFO L274 CegarLoopResult]: For program point KbFilter_PnPEXIT(lines 81 294) no Hoare annotation was computed. [2020-10-23 18:22:49,517 INFO L270 CegarLoopResult]: At program point L112(lines 111 290) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-10-23 18:22:49,517 INFO L270 CegarLoopResult]: At program point L269(lines 172 270) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (<= ~compRegistered~0 0) (not (<= 5 ~MPR1~0)) (not (= |old(~s~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 1)) (= ~compRegistered~0 1) (not (<= 4 ~SKIP2~0))) [2020-10-23 18:22:49,518 INFO L274 CegarLoopResult]: For program point L162(lines 162 273) no Hoare annotation was computed. [2020-10-23 18:22:49,518 INFO L274 CegarLoopResult]: For program point L129(lines 129 284) no Hoare annotation was computed. [2020-10-23 18:22:49,518 INFO L270 CegarLoopResult]: At program point L179(line 179) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-10-23 18:22:49,518 INFO L270 CegarLoopResult]: At program point KbFilter_PnPENTRY(lines 81 294) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-10-23 18:22:49,518 INFO L270 CegarLoopResult]: At program point L171(lines 117 288) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-10-23 18:22:49,518 INFO L274 CegarLoopResult]: For program point L138(lines 138 281) no Hoare annotation was computed. [2020-10-23 18:22:49,518 INFO L274 CegarLoopResult]: For program point KbFilter_PnPFINAL(lines 81 294) no Hoare annotation was computed. [2020-10-23 18:22:49,519 INFO L274 CegarLoopResult]: For program point L147(lines 147 278) no Hoare annotation was computed. [2020-10-23 18:22:49,519 INFO L274 CegarLoopResult]: For program point L114(lines 114 289) no Hoare annotation was computed. [2020-10-23 18:22:49,519 INFO L274 CegarLoopResult]: For program point L156(lines 156 275) no Hoare annotation was computed. [2020-10-23 18:22:49,519 INFO L274 CegarLoopResult]: For program point L123(lines 123 286) no Hoare annotation was computed. [2020-10-23 18:22:49,519 INFO L270 CegarLoopResult]: At program point L115(lines 114 289) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-10-23 18:22:49,519 INFO L274 CegarLoopResult]: For program point L239(lines 239 245) no Hoare annotation was computed. [2020-10-23 18:22:49,519 INFO L270 CegarLoopResult]: At program point L264(lines 264 265) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (<= 4 ~SKIP2~0))) [2020-10-23 18:22:49,519 INFO L274 CegarLoopResult]: For program point L264-1(lines 264 265) no Hoare annotation was computed. [2020-10-23 18:22:49,519 INFO L274 CegarLoopResult]: For program point L165(lines 165 272) no Hoare annotation was computed. [2020-10-23 18:22:49,520 INFO L274 CegarLoopResult]: For program point L132(lines 132 283) no Hoare annotation was computed. [2020-10-23 18:22:49,520 INFO L274 CegarLoopResult]: For program point L223(lines 223 229) no Hoare annotation was computed. [2020-10-23 18:22:49,520 INFO L274 CegarLoopResult]: For program point L182(lines 182 188) no Hoare annotation was computed. [2020-10-23 18:22:49,520 INFO L274 CegarLoopResult]: For program point L182-1(lines 177 189) no Hoare annotation was computed. [2020-10-23 18:22:49,520 INFO L274 CegarLoopResult]: For program point L207(lines 207 213) no Hoare annotation was computed. [2020-10-23 18:22:49,520 INFO L274 CegarLoopResult]: For program point L141(lines 141 280) no Hoare annotation was computed. [2020-10-23 18:22:49,520 INFO L274 CegarLoopResult]: For program point L108(lines 108 291) no Hoare annotation was computed. [2020-10-23 18:22:49,520 INFO L274 CegarLoopResult]: For program point L199(lines 199 205) no Hoare annotation was computed. [2020-10-23 18:22:49,520 INFO L274 CegarLoopResult]: For program point L199-2(lines 172 268) no Hoare annotation was computed. [2020-10-23 18:22:49,520 INFO L270 CegarLoopResult]: At program point L249(line 249) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (<= 4 ~SKIP2~0))) [2020-10-23 18:22:49,521 INFO L274 CegarLoopResult]: For program point L249-1(line 249) no Hoare annotation was computed. [2020-10-23 18:22:49,521 INFO L274 CegarLoopResult]: For program point L150(lines 150 277) no Hoare annotation was computed. [2020-10-23 18:22:49,521 INFO L274 CegarLoopResult]: For program point L117(lines 117 288) no Hoare annotation was computed. [2020-10-23 18:22:49,521 INFO L274 CegarLoopResult]: For program point L208(lines 208 212) no Hoare annotation was computed. [2020-10-23 18:22:49,521 INFO L270 CegarLoopResult]: At program point L109(lines 108 291) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= KbFilter_PnP_~status~0 0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-10-23 18:22:49,521 INFO L270 CegarLoopResult]: At program point L233(lines 233 234) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (<= 4 ~SKIP2~0))) [2020-10-23 18:22:49,521 INFO L274 CegarLoopResult]: For program point L233-1(lines 233 234) no Hoare annotation was computed. [2020-10-23 18:22:49,521 INFO L270 CegarLoopResult]: At program point L258(line 258) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-10-23 18:22:49,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:22:49 BoogieIcfgContainer [2020-10-23 18:22:49,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 18:22:49,578 INFO L168 Benchmark]: Toolchain (without parser) took 39178.69 ms. Allocated memory was 154.1 MB in the beginning and 352.3 MB in the end (delta: 198.2 MB). Free memory was 128.6 MB in the beginning and 226.6 MB in the end (delta: -98.0 MB). Peak memory consumption was 208.3 MB. Max. memory is 8.0 GB. [2020-10-23 18:22:49,578 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 154.1 MB. Free memory is still 126.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 18:22:49,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 506.51 ms. Allocated memory is still 154.1 MB. Free memory was 127.9 MB in the beginning and 109.1 MB in the end (delta: 18.7 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2020-10-23 18:22:49,579 INFO L168 Benchmark]: Boogie Preprocessor took 121.44 ms. Allocated memory is still 154.1 MB. Free memory was 109.1 MB in the beginning and 106.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-10-23 18:22:49,580 INFO L168 Benchmark]: RCFGBuilder took 1132.85 ms. Allocated memory is still 154.1 MB. Free memory was 106.0 MB in the beginning and 70.5 MB in the end (delta: 35.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 8.0 GB. [2020-10-23 18:22:49,583 INFO L168 Benchmark]: TraceAbstraction took 37400.17 ms. Allocated memory was 154.1 MB in the beginning and 352.3 MB in the end (delta: 198.2 MB). Free memory was 69.9 MB in the beginning and 226.6 MB in the end (delta: -156.6 MB). Peak memory consumption was 148.6 MB. Max. memory is 8.0 GB. [2020-10-23 18:22:49,585 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.16 ms. Allocated memory is still 154.1 MB. Free memory is still 126.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 506.51 ms. Allocated memory is still 154.1 MB. Free memory was 127.9 MB in the beginning and 109.1 MB in the end (delta: 18.7 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 121.44 ms. Allocated memory is still 154.1 MB. Free memory was 109.1 MB in the beginning and 106.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1132.85 ms. Allocated memory is still 154.1 MB. Free memory was 106.0 MB in the beginning and 70.5 MB in the end (delta: 35.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 37400.17 ms. Allocated memory was 154.1 MB in the beginning and 352.3 MB in the end (delta: 198.2 MB). Free memory was 69.9 MB in the beginning and 226.6 MB in the end (delta: -156.6 MB). Peak memory consumption was 148.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || ((((((7 <= IPC && 4 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && 2 == DC) && !(pended == 1)) - InvariantResult [Line: 504]: Loop Invariant Derived loop invariant: (((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(5 <= MPR1)) || !(NP == \old(s))) || !(NP == 1)) || (MPR1 == s && __cil_tmp7 + 1073741802 == 0)) || !(4 <= SKIP2)) && ((((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: (((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || s == NP) || !(5 <= MPR1)) || !(\old(s) == 1)) || !(NP == 1)) || !(4 <= SKIP2)) && ((((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(\old(setEventCalled) == 1)) || s == NP) || !(5 <= MPR1)) || !(NP == 1)) || !(MPR3 == \old(s))) || !(4 <= SKIP2)) - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || (((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP) && myStatus == \old(myStatus))) || !(NP == \old(s))) || !(4 <= SKIP2)) || !(compRegistered == 0) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || ((((((7 <= IPC && 4 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && 2 == DC) && !(pended == 1)) - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) == \old(MPR3))) || !(\old(s) <= \old(DC))) || ((((7 <= IPC && 4 <= SKIP2) && 2 == DC) && !(pended == 1)) && (compRegistered <= 0 || compRegistered == 1))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || status == 0) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP)) - InvariantResult [Line: 875]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || (((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP) && myStatus == \old(myStatus))) || !(NP == \old(s))) || !(4 <= SKIP2)) || !(compRegistered == 0) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((((((!(6 <= MPR3) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || compRegistered <= 0) || !(5 <= MPR1)) || !(\old(s) == 1)) || !(\old(compRegistered) == 0)) || !(NP == 1)) || compRegistered == 1) || !(4 <= SKIP2) - InvariantResult [Line: 776]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || (((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP) && myStatus == \old(myStatus))) || !(NP == \old(s))) || !(4 <= SKIP2)) || !(compRegistered == 0) - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || ((((((7 <= IPC && 4 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && 2 == DC) && !(pended == 1)) - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0) - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: (((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || s == NP) || !(5 <= MPR1)) || !(\old(s) == 1)) || !(NP == 1)) || !(4 <= SKIP2)) && ((((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(\old(setEventCalled) == 1)) || s == NP) || !(5 <= MPR1)) || !(NP == 1)) || !(MPR3 == \old(s))) || !(4 <= SKIP2)) - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: (((((((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(NP == \old(s))) || !(4 <= SKIP2)) || !(compRegistered == 0) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((((((((!(6 <= MPR3) || (((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus))) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(5 <= MPR1)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP == 1)) || !(4 <= SKIP2) - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: (((((((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(NP == \old(s))) || !(4 <= SKIP2)) || !(compRegistered == 0) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((!(6 <= MPR3) || (((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus))) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(5 <= MPR1)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP == 1)) || !(4 <= SKIP2) - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || (((((((((NP == 1 && 7 <= IPC) && 4 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && 6 <= MPR3) && 2 == DC) && !(pended == 1)) && 5 <= MPR1) - InvariantResult [Line: 641]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || (((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP) && myStatus == \old(myStatus))) || !(NP == \old(s))) || !(4 <= SKIP2)) || !(compRegistered == 0) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((!(6 <= MPR3) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || ((((((status == 0 && lowerDriverReturn == \old(lowerDriverReturn)) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus))) || !(5 <= MPR1)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP == 1)) || !(4 <= SKIP2) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3))) || ((((7 <= IPC && 4 <= SKIP2) && 2 == DC) && !(pended == 1)) && (compRegistered <= 0 || compRegistered == 1))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP)) - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || ((MPR1 == s && returnVal2 + 1073741823 <= 0) && __cil_tmp7 + 1073741802 == 0)) || ((((MPR1 == s && setEventCalled == 1) && returnVal2 <= 259) && 259 <= returnVal2) && __cil_tmp7 + 1073741802 == 0)) || !(2 == DC)) || !(7 <= IPC)) || !(5 <= MPR1)) || !(\old(s) == 1)) || (((returnVal2 <= 0 && MPR1 == s) && 0 <= returnVal2) && __cil_tmp7 + 1073741802 == 0)) || !(NP == 1)) || !(4 <= SKIP2)) && ((((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) - InvariantResult [Line: 891]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || (((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP) && myStatus == \old(myStatus))) || !(NP == \old(s))) || !(4 <= SKIP2)) || !(compRegistered == 0) - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: (((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(5 <= MPR1)) || !(\old(s) == 1)) || !(NP == 1)) || ((setEventCalled == \old(setEventCalled) && s == NP) && \old(customIrp) == customIrp)) || !(4 <= SKIP2)) && (((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(\old(setEventCalled) == 1)) || !(5 <= MPR1)) || !(NP == 1)) || !(MPR3 == \old(s))) || !(4 <= SKIP2)) - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) == \old(MPR3))) || !(\old(s) <= \old(DC))) || ((((7 <= IPC && 4 <= SKIP2) && 2 == DC) && !(pended == 1)) && (compRegistered <= 0 || compRegistered == 1))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP)) - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(5 <= MPR1)) || !(NP == \old(s))) || !(NP == 1)) || (MPR1 == s && __cil_tmp7 + 1073741802 == 0)) || !(4 <= SKIP2)) && ((((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: ((((((((!(6 <= MPR3) || (((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus))) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(5 <= MPR1)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP == 1)) || !(4 <= SKIP2) - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || ((((((7 <= IPC && 4 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && 2 == DC) && !(pended == 1)) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: (((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(5 <= MPR1)) || !(NP == \old(s))) || !(NP == 1)) || !(4 <= SKIP2)) || ((MPR1 == s && setEventCalled == 1) && __cil_tmp7 + 1073741802 == 0)) && ((((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) - InvariantResult [Line: 867]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || (((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP) && myStatus == \old(myStatus))) || !(NP == \old(s))) || !(4 <= SKIP2)) || !(compRegistered == 0) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) == \old(MPR3))) || !(\old(s) <= \old(DC))) || ((((7 <= IPC && 4 <= SKIP2) && 2 == DC) && !(pended == 1)) && (compRegistered <= 0 || compRegistered == 1))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP)) - InvariantResult [Line: 769]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 243 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 24.3s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3178 SDtfs, 4912 SDslu, 3732 SDs, 0 SdLazy, 6978 SolverSat, 1206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 176 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 85 LocationsWithAnnotation, 401 PreInvPairs, 505 NumberOfFragments, 4184 HoareAnnotationTreeSize, 401 FomulaSimplifications, 1748 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 85 FomulaSimplificationsInter, 10274 FormulaSimplificationTreeSizeReductionInter, 11.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1127 NumberOfCodeBlocks, 1127 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1106 ConstructedInterpolants, 0 QuantifiedInterpolants, 307787 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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 correct! Received shutdown request...