/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks.term.scoring.heuristic DAGSIZE --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -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.1.25-79ed534 [2020-07-20 03:36:16,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 03:36:16,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 03:36:16,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 03:36:16,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 03:36:16,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 03:36:16,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 03:36:16,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 03:36:16,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 03:36:16,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 03:36:16,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 03:36:16,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 03:36:16,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 03:36:16,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 03:36:16,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 03:36:16,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 03:36:16,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 03:36:16,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 03:36:16,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 03:36:16,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 03:36:16,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 03:36:16,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 03:36:16,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 03:36:16,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 03:36:16,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 03:36:16,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 03:36:16,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 03:36:16,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 03:36:16,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 03:36:16,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 03:36:16,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 03:36:16,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 03:36:16,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 03:36:16,231 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 03:36:16,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 03:36:16,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 03:36:16,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 03:36:16,233 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 03:36:16,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 03:36:16,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 03:36:16,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 03:36:16,236 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-07-20 03:36:16,251 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 03:36:16,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 03:36:16,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 03:36:16,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 03:36:16,253 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 03:36:16,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 03:36:16,254 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 03:36:16,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 03:36:16,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 03:36:16,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 03:36:16,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 03:36:16,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 03:36:16,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 03:36:16,255 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 03:36:16,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 03:36:16,256 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 03:36:16,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 03:36:16,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 03:36:16,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 03:36:16,256 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 03:36:16,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 03:36:16,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 03:36:16,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 03:36:16,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 03:36:16,258 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 03:36:16,258 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 03:36:16,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 03:36:16,258 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 03:36:16,258 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 03:36:16,259 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> DAGSIZE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 03:36:16,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 03:36:16,598 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 03:36:16,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 03:36:16,604 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 03:36:16,604 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 03:36:16,605 INFO L429 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-07-20 03:36:16,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c74c7aaa/0288adede7454517849c8566d5b57150/FLAGcd67048e0 [2020-07-20 03:36:17,242 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 03:36:17,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2020-07-20 03:36:17,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c74c7aaa/0288adede7454517849c8566d5b57150/FLAGcd67048e0 [2020-07-20 03:36:17,497 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c74c7aaa/0288adede7454517849c8566d5b57150 [2020-07-20 03:36:17,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 03:36:17,513 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 03:36:17,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 03:36:17,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 03:36:17,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 03:36:17,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:36:17" (1/1) ... [2020-07-20 03:36:17,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19856784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:17, skipping insertion in model container [2020-07-20 03:36:17,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:36:17" (1/1) ... [2020-07-20 03:36:17,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 03:36:17,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 03:36:17,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 03:36:17,894 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 03:36:18,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 03:36:18,131 INFO L208 MainTranslator]: Completed translation [2020-07-20 03:36:18,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:18 WrapperNode [2020-07-20 03:36:18,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 03:36:18,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 03:36:18,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 03:36:18,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 03:36:18,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:18" (1/1) ... [2020-07-20 03:36:18,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:18" (1/1) ... [2020-07-20 03:36:18,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:18" (1/1) ... [2020-07-20 03:36:18,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:18" (1/1) ... [2020-07-20 03:36:18,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:18" (1/1) ... [2020-07-20 03:36:18,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:18" (1/1) ... [2020-07-20 03:36:18,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:18" (1/1) ... [2020-07-20 03:36:18,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 03:36:18,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 03:36:18,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 03:36:18,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 03:36:18,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:18" (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-07-20 03:36:18,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 03:36:18,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 03:36:18,283 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-07-20 03:36:18,284 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-07-20 03:36:18,284 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2020-07-20 03:36:18,284 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 03:36:18,284 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-07-20 03:36:18,284 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-07-20 03:36:18,284 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-07-20 03:36:18,285 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-07-20 03:36:18,285 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-07-20 03:36:18,285 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2020-07-20 03:36:18,285 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2020-07-20 03:36:18,285 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2020-07-20 03:36:18,285 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2020-07-20 03:36:18,286 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2020-07-20 03:36:18,286 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2020-07-20 03:36:18,286 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-07-20 03:36:18,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 03:36:18,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-20 03:36:18,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 03:36:18,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-07-20 03:36:18,287 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2020-07-20 03:36:18,287 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2020-07-20 03:36:18,287 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-07-20 03:36:18,287 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-07-20 03:36:18,287 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-07-20 03:36:18,288 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2020-07-20 03:36:18,288 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2020-07-20 03:36:18,288 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2020-07-20 03:36:18,288 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2020-07-20 03:36:18,288 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2020-07-20 03:36:18,288 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-07-20 03:36:18,289 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-07-20 03:36:18,289 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-07-20 03:36:18,289 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-07-20 03:36:18,289 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 03:36:18,289 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-07-20 03:36:18,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 03:36:18,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 03:36:18,604 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-20 03:36:18,678 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2020-07-20 03:36:18,678 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2020-07-20 03:36:18,709 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-20 03:36:18,871 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2020-07-20 03:36:18,872 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2020-07-20 03:36:18,877 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-20 03:36:18,941 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2020-07-20 03:36:18,942 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2020-07-20 03:36:18,950 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-20 03:36:18,996 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2020-07-20 03:36:18,996 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2020-07-20 03:36:19,092 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-20 03:36:19,128 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-07-20 03:36:19,128 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-07-20 03:36:19,172 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-20 03:36:19,284 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2020-07-20 03:36:19,284 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2020-07-20 03:36:19,304 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 03:36:19,304 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-20 03:36:19,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:36:19 BoogieIcfgContainer [2020-07-20 03:36:19,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 03:36:19,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 03:36:19,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 03:36:19,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 03:36:19,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 03:36:17" (1/3) ... [2020-07-20 03:36:19,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119cf386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:36:19, skipping insertion in model container [2020-07-20 03:36:19,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:18" (2/3) ... [2020-07-20 03:36:19,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119cf386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:36:19, skipping insertion in model container [2020-07-20 03:36:19,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:36:19" (3/3) ... [2020-07-20 03:36:19,321 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2020-07-20 03:36:19,333 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 03:36:19,343 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 03:36:19,359 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 03:36:19,388 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 03:36:19,389 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 03:36:19,389 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 03:36:19,389 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 03:36:19,389 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 03:36:19,390 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 03:36:19,390 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 03:36:19,390 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 03:36:19,424 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states. [2020-07-20 03:36:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-20 03:36:19,433 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:19,434 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] [2020-07-20 03:36:19,435 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:19,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:19,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1712773315, now seen corresponding path program 1 times [2020-07-20 03:36:19,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:19,454 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832289235] [2020-07-20 03:36:19,455 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2919a46d [2020-07-20 03:36:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:19,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:19,906 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832289235] [2020-07-20 03:36:19,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:19,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 03:36:19,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958186080] [2020-07-20 03:36:19,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 03:36:19,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:19,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 03:36:19,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-20 03:36:19,939 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 5 states. [2020-07-20 03:36:21,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:21,068 INFO L93 Difference]: Finished difference Result 416 states and 625 transitions. [2020-07-20 03:36:21,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 03:36:21,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-20 03:36:21,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:21,089 INFO L225 Difference]: With dead ends: 416 [2020-07-20 03:36:21,089 INFO L226 Difference]: Without dead ends: 256 [2020-07-20 03:36:21,097 INFO L675 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-07-20 03:36:21,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-07-20 03:36:21,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 228. [2020-07-20 03:36:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2020-07-20 03:36:21,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2020-07-20 03:36:21,192 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 20 [2020-07-20 03:36:21,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:21,194 INFO L479 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2020-07-20 03:36:21,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 03:36:21,195 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2020-07-20 03:36:21,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-20 03:36:21,197 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:21,198 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] [2020-07-20 03:36:21,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 03:36:21,199 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:21,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:21,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1840561730, now seen corresponding path program 1 times [2020-07-20 03:36:21,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:21,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349359288] [2020-07-20 03:36:21,200 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2919a46d [2020-07-20 03:36:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:21,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:21,496 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349359288] [2020-07-20 03:36:21,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:21,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 03:36:21,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601761785] [2020-07-20 03:36:21,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 03:36:21,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:21,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 03:36:21,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-20 03:36:21,500 INFO L87 Difference]: Start difference. First operand 228 states and 322 transitions. Second operand 6 states. [2020-07-20 03:36:22,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:22,800 INFO L93 Difference]: Finished difference Result 401 states and 553 transitions. [2020-07-20 03:36:22,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 03:36:22,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-20 03:36:22,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:22,806 INFO L225 Difference]: With dead ends: 401 [2020-07-20 03:36:22,806 INFO L226 Difference]: Without dead ends: 343 [2020-07-20 03:36:22,809 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-07-20 03:36:22,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-07-20 03:36:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 301. [2020-07-20 03:36:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-07-20 03:36:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 411 transitions. [2020-07-20 03:36:22,882 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 411 transitions. Word has length 28 [2020-07-20 03:36:22,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:22,882 INFO L479 AbstractCegarLoop]: Abstraction has 301 states and 411 transitions. [2020-07-20 03:36:22,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 03:36:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 411 transitions. [2020-07-20 03:36:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-20 03:36:22,884 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:22,884 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] [2020-07-20 03:36:22,885 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 03:36:22,885 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:22,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:22,885 INFO L82 PathProgramCache]: Analyzing trace with hash -919522484, now seen corresponding path program 1 times [2020-07-20 03:36:22,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:22,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310767745] [2020-07-20 03:36:22,886 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2919a46d [2020-07-20 03:36:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:23,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:23,038 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310767745] [2020-07-20 03:36:23,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:23,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 03:36:23,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755155731] [2020-07-20 03:36:23,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 03:36:23,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:23,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 03:36:23,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-20 03:36:23,041 INFO L87 Difference]: Start difference. First operand 301 states and 411 transitions. Second operand 6 states. [2020-07-20 03:36:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:23,831 INFO L93 Difference]: Finished difference Result 478 states and 635 transitions. [2020-07-20 03:36:23,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 03:36:23,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-20 03:36:23,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:23,837 INFO L225 Difference]: With dead ends: 478 [2020-07-20 03:36:23,837 INFO L226 Difference]: Without dead ends: 362 [2020-07-20 03:36:23,840 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-07-20 03:36:23,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2020-07-20 03:36:23,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2020-07-20 03:36:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-07-20 03:36:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 462 transitions. [2020-07-20 03:36:23,878 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 462 transitions. Word has length 28 [2020-07-20 03:36:23,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:23,878 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 462 transitions. [2020-07-20 03:36:23,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 03:36:23,879 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 462 transitions. [2020-07-20 03:36:23,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-20 03:36:23,881 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:23,882 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] [2020-07-20 03:36:23,882 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 03:36:23,882 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:23,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:23,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1823384951, now seen corresponding path program 1 times [2020-07-20 03:36:23,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:23,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9689730] [2020-07-20 03:36:23,884 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2919a46d [2020-07-20 03:36:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:24,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9689730] [2020-07-20 03:36:24,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:24,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 03:36:24,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064193416] [2020-07-20 03:36:24,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 03:36:24,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:24,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 03:36:24,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-20 03:36:24,044 INFO L87 Difference]: Start difference. First operand 341 states and 462 transitions. Second operand 6 states. [2020-07-20 03:36:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:24,648 INFO L93 Difference]: Finished difference Result 344 states and 464 transitions. [2020-07-20 03:36:24,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 03:36:24,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-20 03:36:24,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:24,652 INFO L225 Difference]: With dead ends: 344 [2020-07-20 03:36:24,652 INFO L226 Difference]: Without dead ends: 340 [2020-07-20 03:36:24,653 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-20 03:36:24,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-07-20 03:36:24,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2020-07-20 03:36:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-07-20 03:36:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 459 transitions. [2020-07-20 03:36:24,680 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 459 transitions. Word has length 38 [2020-07-20 03:36:24,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:24,681 INFO L479 AbstractCegarLoop]: Abstraction has 340 states and 459 transitions. [2020-07-20 03:36:24,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 03:36:24,681 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 459 transitions. [2020-07-20 03:36:24,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-20 03:36:24,684 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:24,685 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-07-20 03:36:24,685 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 03:36:24,685 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:24,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:24,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1946925920, now seen corresponding path program 1 times [2020-07-20 03:36:24,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:24,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887116185] [2020-07-20 03:36:24,686 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2919a46d [2020-07-20 03:36:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:24,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:24,875 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887116185] [2020-07-20 03:36:24,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:24,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 03:36:24,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179696476] [2020-07-20 03:36:24,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 03:36:24,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:24,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 03:36:24,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-20 03:36:24,878 INFO L87 Difference]: Start difference. First operand 340 states and 459 transitions. Second operand 8 states. [2020-07-20 03:36:25,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:25,832 INFO L93 Difference]: Finished difference Result 385 states and 508 transitions. [2020-07-20 03:36:25,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 03:36:25,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2020-07-20 03:36:25,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:25,835 INFO L225 Difference]: With dead ends: 385 [2020-07-20 03:36:25,835 INFO L226 Difference]: Without dead ends: 319 [2020-07-20 03:36:25,836 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-07-20 03:36:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-07-20 03:36:25,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 301. [2020-07-20 03:36:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-07-20 03:36:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 402 transitions. [2020-07-20 03:36:25,863 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 402 transitions. Word has length 46 [2020-07-20 03:36:25,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:25,863 INFO L479 AbstractCegarLoop]: Abstraction has 301 states and 402 transitions. [2020-07-20 03:36:25,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 03:36:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 402 transitions. [2020-07-20 03:36:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-20 03:36:25,865 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:25,866 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] [2020-07-20 03:36:25,866 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-20 03:36:25,866 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:25,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:25,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1615603168, now seen corresponding path program 1 times [2020-07-20 03:36:25,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:25,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816096059] [2020-07-20 03:36:25,867 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2919a46d [2020-07-20 03:36:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:26,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816096059] [2020-07-20 03:36:26,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:26,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 03:36:26,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474480538] [2020-07-20 03:36:26,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 03:36:26,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:26,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 03:36:26,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-07-20 03:36:26,058 INFO L87 Difference]: Start difference. First operand 301 states and 402 transitions. Second operand 8 states. [2020-07-20 03:36:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:26,465 INFO L93 Difference]: Finished difference Result 310 states and 413 transitions. [2020-07-20 03:36:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 03:36:26,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-20 03:36:26,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:26,468 INFO L225 Difference]: With dead ends: 310 [2020-07-20 03:36:26,469 INFO L226 Difference]: Without dead ends: 102 [2020-07-20 03:36:26,470 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-07-20 03:36:26,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-07-20 03:36:26,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-07-20 03:36:26,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-20 03:36:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2020-07-20 03:36:26,520 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 45 [2020-07-20 03:36:26,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:26,520 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2020-07-20 03:36:26,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 03:36:26,520 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2020-07-20 03:36:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-20 03:36:26,521 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:26,521 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] [2020-07-20 03:36:26,521 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-20 03:36:26,522 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:26,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:26,522 INFO L82 PathProgramCache]: Analyzing trace with hash -582629432, now seen corresponding path program 1 times [2020-07-20 03:36:26,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:26,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477560437] [2020-07-20 03:36:26,523 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2919a46d [2020-07-20 03:36:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:26,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477560437] [2020-07-20 03:36:26,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:26,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 03:36:26,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956304039] [2020-07-20 03:36:26,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 03:36:26,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:26,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 03:36:26,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-20 03:36:26,714 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand 8 states. [2020-07-20 03:36:27,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:27,053 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2020-07-20 03:36:27,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 03:36:27,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-07-20 03:36:27,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:27,055 INFO L225 Difference]: With dead ends: 130 [2020-07-20 03:36:27,056 INFO L226 Difference]: Without dead ends: 100 [2020-07-20 03:36:27,057 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-07-20 03:36:27,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-20 03:36:27,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2020-07-20 03:36:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-20 03:36:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2020-07-20 03:36:27,067 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2020-07-20 03:36:27,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:27,067 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2020-07-20 03:36:27,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 03:36:27,068 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2020-07-20 03:36:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-20 03:36:27,069 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:27,069 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] [2020-07-20 03:36:27,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-20 03:36:27,070 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:27,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:27,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1306380805, now seen corresponding path program 1 times [2020-07-20 03:36:27,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:27,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943754162] [2020-07-20 03:36:27,072 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2919a46d [2020-07-20 03:36:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:27,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:27,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943754162] [2020-07-20 03:36:27,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:27,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-20 03:36:27,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000462270] [2020-07-20 03:36:27,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 03:36:27,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:27,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 03:36:27,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-20 03:36:27,355 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 11 states. [2020-07-20 03:36:27,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:27,596 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2020-07-20 03:36:27,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 03:36:27,597 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2020-07-20 03:36:27,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:27,601 INFO L225 Difference]: With dead ends: 152 [2020-07-20 03:36:27,601 INFO L226 Difference]: Without dead ends: 111 [2020-07-20 03:36:27,602 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-20 03:36:27,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-07-20 03:36:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2020-07-20 03:36:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-20 03:36:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2020-07-20 03:36:27,614 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 57 [2020-07-20 03:36:27,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:27,614 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2020-07-20 03:36:27,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 03:36:27,615 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2020-07-20 03:36:27,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-20 03:36:27,616 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:27,616 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] [2020-07-20 03:36:27,616 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-20 03:36:27,617 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:27,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:27,617 INFO L82 PathProgramCache]: Analyzing trace with hash -538994442, now seen corresponding path program 1 times [2020-07-20 03:36:27,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:27,618 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420423098] [2020-07-20 03:36:27,618 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2919a46d [2020-07-20 03:36:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:27,962 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420423098] [2020-07-20 03:36:27,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:27,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-20 03:36:27,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569456264] [2020-07-20 03:36:27,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 03:36:27,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:27,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 03:36:27,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-20 03:36:27,971 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 11 states. [2020-07-20 03:36:28,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:28,280 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2020-07-20 03:36:28,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 03:36:28,281 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2020-07-20 03:36:28,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:28,283 INFO L225 Difference]: With dead ends: 116 [2020-07-20 03:36:28,283 INFO L226 Difference]: Without dead ends: 109 [2020-07-20 03:36:28,284 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2020-07-20 03:36:28,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-20 03:36:28,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2020-07-20 03:36:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-20 03:36:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2020-07-20 03:36:28,298 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 57 [2020-07-20 03:36:28,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:28,299 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2020-07-20 03:36:28,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 03:36:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2020-07-20 03:36:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-20 03:36:28,300 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:28,300 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-07-20 03:36:28,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-20 03:36:28,301 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:28,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:28,301 INFO L82 PathProgramCache]: Analyzing trace with hash -914264427, now seen corresponding path program 1 times [2020-07-20 03:36:28,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:28,302 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236018044] [2020-07-20 03:36:28,302 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2919a46d [2020-07-20 03:36:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:28,501 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236018044] [2020-07-20 03:36:28,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:28,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 03:36:28,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553822491] [2020-07-20 03:36:28,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 03:36:28,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:28,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 03:36:28,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-20 03:36:28,503 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 8 states. [2020-07-20 03:36:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:28,842 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2020-07-20 03:36:28,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 03:36:28,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2020-07-20 03:36:28,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:28,844 INFO L225 Difference]: With dead ends: 122 [2020-07-20 03:36:28,844 INFO L226 Difference]: Without dead ends: 117 [2020-07-20 03:36:28,845 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-07-20 03:36:28,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-07-20 03:36:28,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2020-07-20 03:36:28,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-20 03:36:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2020-07-20 03:36:28,855 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 58 [2020-07-20 03:36:28,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:28,856 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2020-07-20 03:36:28,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 03:36:28,856 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2020-07-20 03:36:28,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-20 03:36:28,857 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:28,857 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-07-20 03:36:28,857 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-20 03:36:28,857 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:28,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:28,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1535327622, now seen corresponding path program 1 times [2020-07-20 03:36:28,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:28,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753107947] [2020-07-20 03:36:28,859 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2919a46d [2020-07-20 03:36:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:29,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:29,137 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753107947] [2020-07-20 03:36:29,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:29,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 03:36:29,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862345069] [2020-07-20 03:36:29,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 03:36:29,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:29,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 03:36:29,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-20 03:36:29,139 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 10 states. [2020-07-20 03:36:29,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:29,320 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2020-07-20 03:36:29,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 03:36:29,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2020-07-20 03:36:29,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:29,322 INFO L225 Difference]: With dead ends: 146 [2020-07-20 03:36:29,322 INFO L226 Difference]: Without dead ends: 102 [2020-07-20 03:36:29,323 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-20 03:36:29,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-07-20 03:36:29,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-07-20 03:36:29,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-20 03:36:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2020-07-20 03:36:29,333 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 58 [2020-07-20 03:36:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:29,334 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2020-07-20 03:36:29,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 03:36:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2020-07-20 03:36:29,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-20 03:36:29,335 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:29,335 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] [2020-07-20 03:36:29,335 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-20 03:36:29,335 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:29,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:29,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1832020397, now seen corresponding path program 1 times [2020-07-20 03:36:29,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:29,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001743857] [2020-07-20 03:36:29,337 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2919a46d [2020-07-20 03:36:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:29,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:29,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001743857] [2020-07-20 03:36:29,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:29,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-20 03:36:29,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218359928] [2020-07-20 03:36:29,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 03:36:29,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:29,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 03:36:29,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-07-20 03:36:29,597 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 11 states. [2020-07-20 03:36:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:29,997 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2020-07-20 03:36:29,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 03:36:29,998 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2020-07-20 03:36:29,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:29,999 INFO L225 Difference]: With dead ends: 132 [2020-07-20 03:36:29,999 INFO L226 Difference]: Without dead ends: 94 [2020-07-20 03:36:30,001 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2020-07-20 03:36:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-07-20 03:36:30,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-07-20 03:36:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-20 03:36:30,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2020-07-20 03:36:30,011 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 62 [2020-07-20 03:36:30,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:30,012 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2020-07-20 03:36:30,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 03:36:30,012 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2020-07-20 03:36:30,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-20 03:36:30,013 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:30,013 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] [2020-07-20 03:36:30,013 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-20 03:36:30,013 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:30,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:30,014 INFO L82 PathProgramCache]: Analyzing trace with hash 198062706, now seen corresponding path program 1 times [2020-07-20 03:36:30,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:30,014 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695963855] [2020-07-20 03:36:30,015 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2919a46d [2020-07-20 03:36:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:30,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695963855] [2020-07-20 03:36:30,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:30,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 03:36:30,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691101224] [2020-07-20 03:36:30,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 03:36:30,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:30,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 03:36:30,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-07-20 03:36:30,224 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 9 states. [2020-07-20 03:36:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:30,446 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2020-07-20 03:36:30,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 03:36:30,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2020-07-20 03:36:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:30,448 INFO L225 Difference]: With dead ends: 130 [2020-07-20 03:36:30,448 INFO L226 Difference]: Without dead ends: 100 [2020-07-20 03:36:30,449 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-07-20 03:36:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-20 03:36:30,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2020-07-20 03:36:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-20 03:36:30,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2020-07-20 03:36:30,460 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 64 [2020-07-20 03:36:30,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:30,461 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2020-07-20 03:36:30,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 03:36:30,461 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2020-07-20 03:36:30,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-20 03:36:30,462 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:30,462 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] [2020-07-20 03:36:30,463 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-20 03:36:30,463 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:30,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:30,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1883613746, now seen corresponding path program 1 times [2020-07-20 03:36:30,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:30,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152439829] [2020-07-20 03:36:30,464 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2919a46d [2020-07-20 03:36:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:30,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:30,702 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152439829] [2020-07-20 03:36:30,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:30,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-20 03:36:30,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754512803] [2020-07-20 03:36:30,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 03:36:30,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:30,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 03:36:30,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-20 03:36:30,704 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 12 states. [2020-07-20 03:36:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:31,049 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2020-07-20 03:36:31,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 03:36:31,050 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2020-07-20 03:36:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:31,051 INFO L225 Difference]: With dead ends: 110 [2020-07-20 03:36:31,051 INFO L226 Difference]: Without dead ends: 103 [2020-07-20 03:36:31,053 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-07-20 03:36:31,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-20 03:36:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2020-07-20 03:36:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-20 03:36:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2020-07-20 03:36:31,064 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 64 [2020-07-20 03:36:31,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:31,065 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2020-07-20 03:36:31,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 03:36:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2020-07-20 03:36:31,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-20 03:36:31,066 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:31,067 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-07-20 03:36:31,067 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-20 03:36:31,067 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:31,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:31,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1968245100, now seen corresponding path program 1 times [2020-07-20 03:36:31,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:31,068 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045551352] [2020-07-20 03:36:31,069 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2919a46d [2020-07-20 03:36:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:31,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045551352] [2020-07-20 03:36:31,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:31,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-20 03:36:31,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102494691] [2020-07-20 03:36:31,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 03:36:31,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:31,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 03:36:31,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-07-20 03:36:31,362 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 12 states. [2020-07-20 03:36:32,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:32,111 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2020-07-20 03:36:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 03:36:32,112 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2020-07-20 03:36:32,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:32,114 INFO L225 Difference]: With dead ends: 109 [2020-07-20 03:36:32,114 INFO L226 Difference]: Without dead ends: 91 [2020-07-20 03:36:32,115 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2020-07-20 03:36:32,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-20 03:36:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2020-07-20 03:36:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-20 03:36:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2020-07-20 03:36:32,134 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 65 [2020-07-20 03:36:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:32,134 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2020-07-20 03:36:32,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 03:36:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2020-07-20 03:36:32,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-20 03:36:32,136 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:32,136 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-07-20 03:36:32,136 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-20 03:36:32,137 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:32,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:32,137 INFO L82 PathProgramCache]: Analyzing trace with hash -603130258, now seen corresponding path program 1 times [2020-07-20 03:36:32,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:32,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228307777] [2020-07-20 03:36:32,138 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2919a46d [2020-07-20 03:36:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:32,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:32,509 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228307777] [2020-07-20 03:36:32,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:32,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 03:36:32,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059469911] [2020-07-20 03:36:32,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 03:36:32,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:32,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 03:36:32,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-07-20 03:36:32,518 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 10 states. [2020-07-20 03:36:32,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:32,887 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2020-07-20 03:36:32,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 03:36:32,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2020-07-20 03:36:32,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:32,890 INFO L225 Difference]: With dead ends: 98 [2020-07-20 03:36:32,892 INFO L226 Difference]: Without dead ends: 78 [2020-07-20 03:36:32,893 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-07-20 03:36:32,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-20 03:36:32,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-07-20 03:36:32,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-20 03:36:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2020-07-20 03:36:32,908 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2020-07-20 03:36:32,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:32,908 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2020-07-20 03:36:32,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 03:36:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2020-07-20 03:36:32,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-20 03:36:32,910 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:32,910 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-07-20 03:36:32,910 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-20 03:36:32,910 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:32,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:32,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1151601388, now seen corresponding path program 1 times [2020-07-20 03:36:32,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:32,911 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290398391] [2020-07-20 03:36:32,911 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2919a46d [2020-07-20 03:36:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:33,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:33,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290398391] [2020-07-20 03:36:33,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:33,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-20 03:36:33,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664635054] [2020-07-20 03:36:33,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 03:36:33,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:33,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 03:36:33,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-20 03:36:33,264 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 12 states. [2020-07-20 03:36:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:33,523 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2020-07-20 03:36:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 03:36:33,524 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2020-07-20 03:36:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:33,525 INFO L225 Difference]: With dead ends: 87 [2020-07-20 03:36:33,525 INFO L226 Difference]: Without dead ends: 78 [2020-07-20 03:36:33,526 INFO L675 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-07-20 03:36:33,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-20 03:36:33,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-07-20 03:36:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-20 03:36:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2020-07-20 03:36:33,536 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 65 [2020-07-20 03:36:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:33,537 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2020-07-20 03:36:33,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 03:36:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2020-07-20 03:36:33,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-07-20 03:36:33,540 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:33,540 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] [2020-07-20 03:36:33,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-20 03:36:33,540 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:33,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:33,541 INFO L82 PathProgramCache]: Analyzing trace with hash -42695807, now seen corresponding path program 1 times [2020-07-20 03:36:33,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:33,542 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242222530] [2020-07-20 03:36:33,542 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2919a46d [2020-07-20 03:36:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:33,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:33,808 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242222530] [2020-07-20 03:36:33,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:33,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-20 03:36:33,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856953783] [2020-07-20 03:36:33,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 03:36:33,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:33,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 03:36:33,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-07-20 03:36:33,816 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 11 states. [2020-07-20 03:36:34,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:34,035 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2020-07-20 03:36:34,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 03:36:34,036 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2020-07-20 03:36:34,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:34,036 INFO L225 Difference]: With dead ends: 78 [2020-07-20 03:36:34,036 INFO L226 Difference]: Without dead ends: 0 [2020-07-20 03:36:34,037 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-07-20 03:36:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-20 03:36:34,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-20 03:36:34,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-20 03:36:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-20 03:36:34,038 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2020-07-20 03:36:34,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:34,038 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-20 03:36:34,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 03:36:34,039 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-20 03:36:34,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-20 03:36:34,039 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-20 03:36:34,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-20 03:36:34,861 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-07-20 03:36:35,236 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 18 [2020-07-20 03:36:35,854 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2020-07-20 03:36:36,360 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 40 [2020-07-20 03:36:36,542 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2020-07-20 03:36:36,832 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 30 [2020-07-20 03:36:37,010 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2020-07-20 03:36:37,136 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 28 [2020-07-20 03:36:37,495 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2020-07-20 03:36:37,662 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2020-07-20 03:36:37,874 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2020-07-20 03:36:37,999 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2020-07-20 03:36:38,286 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2020-07-20 03:36:38,816 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-07-20 03:36:39,280 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2020-07-20 03:36:39,499 INFO L264 CegarLoopResult]: At program point KeSetEventENTRY(lines 566 573) the Hoare annotation is: (or (not (= ~s~0 ~NP~0)) (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= 1 ~pended~0) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))) [2020-07-20 03:36:39,499 INFO L268 CegarLoopResult]: For program point KeSetEventFINAL(lines 566 573) no Hoare annotation was computed. [2020-07-20 03:36:39,499 INFO L268 CegarLoopResult]: For program point KeSetEventEXIT(lines 566 573) no Hoare annotation was computed. [2020-07-20 03:36:39,500 INFO L264 CegarLoopResult]: At program point KbFilter_CompleteENTRY(lines 616 626) the Hoare annotation is: (or (not (= ~s~0 ~NP~0)) (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= 1 ~pended~0) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))) [2020-07-20 03:36:39,500 INFO L264 CegarLoopResult]: At program point L622(line 622) the Hoare annotation is: (or (not (= ~s~0 ~NP~0)) (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= 1 ~pended~0) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))) [2020-07-20 03:36:39,501 INFO L268 CegarLoopResult]: For program point L622-1(line 622) no Hoare annotation was computed. [2020-07-20 03:36:39,501 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteFINAL(lines 616 626) no Hoare annotation was computed. [2020-07-20 03:36:39,501 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteEXIT(lines 616 626) no Hoare annotation was computed. [2020-07-20 03:36:39,502 INFO L268 CegarLoopResult]: For program point L704(lines 704 725) no Hoare annotation was computed. [2020-07-20 03:36:39,502 INFO L268 CegarLoopResult]: For program point L698(lines 698 727) no Hoare annotation was computed. [2020-07-20 03:36:39,502 INFO L268 CegarLoopResult]: For program point KbFilter_PowerEXIT(lines 687 742) no Hoare annotation was computed. [2020-07-20 03:36:39,502 INFO L264 CegarLoopResult]: At program point KbFilter_PowerENTRY(lines 687 742) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|))) [2020-07-20 03:36:39,502 INFO L268 CegarLoopResult]: For program point L707(lines 707 724) no Hoare annotation was computed. [2020-07-20 03:36:39,502 INFO L264 CegarLoopResult]: At program point L738(line 738) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) [2020-07-20 03:36:39,502 INFO L268 CegarLoopResult]: For program point L738-1(line 738) no Hoare annotation was computed. [2020-07-20 03:36:39,502 INFO L268 CegarLoopResult]: For program point L701(lines 701 726) no Hoare annotation was computed. [2020-07-20 03:36:39,503 INFO L264 CegarLoopResult]: At program point L732(line 732) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|))) [2020-07-20 03:36:39,503 INFO L264 CegarLoopResult]: At program point L699(lines 698 727) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|))) [2020-07-20 03:36:39,503 INFO L268 CegarLoopResult]: For program point L732-1(lines 728 734) no Hoare annotation was computed. [2020-07-20 03:36:39,503 INFO L268 CegarLoopResult]: For program point KbFilter_PowerFINAL(lines 687 742) no Hoare annotation was computed. [2020-07-20 03:36:39,503 INFO L264 CegarLoopResult]: At program point L722(lines 697 741) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|))) [2020-07-20 03:36:39,504 INFO L268 CegarLoopResult]: For program point stub_driver_initEXIT(lines 41 54) no Hoare annotation was computed. [2020-07-20 03:36:39,504 INFO L264 CegarLoopResult]: At program point stub_driver_initENTRY(lines 41 54) the Hoare annotation is: (or (and (= ~pended~0 |old(~pended~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-20 03:36:39,504 INFO L268 CegarLoopResult]: For program point stub_driver_initFINAL(lines 41 54) no Hoare annotation was computed. [2020-07-20 03:36:39,504 INFO L268 CegarLoopResult]: For program point _BLAST_initFINAL(lines 55 76) no Hoare annotation was computed. [2020-07-20 03:36:39,505 INFO L264 CegarLoopResult]: At program point _BLAST_initENTRY(lines 55 76) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (and (= ~pended~0 |old(~pended~0)|) (= ~DC~0 |old(~DC~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~MPR1~0 ~s~0) (= ~compFptr~0 |old(~compFptr~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= ~MPR3~0 |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-20 03:36:39,505 INFO L268 CegarLoopResult]: For program point _BLAST_initEXIT(lines 55 76) no Hoare annotation was computed. [2020-07-20 03:36:39,505 INFO L271 CegarLoopResult]: At program point errorFnENTRY(lines 1007 1014) the Hoare annotation is: true [2020-07-20 03:36:39,505 INFO L268 CegarLoopResult]: For program point errorFnFINAL(lines 1007 1014) no Hoare annotation was computed. [2020-07-20 03:36:39,505 INFO L268 CegarLoopResult]: For program point errorFnEXIT(lines 1007 1014) no Hoare annotation was computed. [2020-07-20 03:36:39,505 INFO L268 CegarLoopResult]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2020-07-20 03:36:39,506 INFO L268 CegarLoopResult]: For program point L448(lines 448 450) no Hoare annotation was computed. [2020-07-20 03:36:39,506 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 293 464) no Hoare annotation was computed. [2020-07-20 03:36:39,506 INFO L264 CegarLoopResult]: At program point L374(lines 373 406) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (<= 0 main_~status~1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-20 03:36:39,506 INFO L268 CegarLoopResult]: For program point L432(lines 432 434) no Hoare annotation was computed. [2020-07-20 03:36:39,506 INFO L268 CegarLoopResult]: For program point L366(lines 366 407) no Hoare annotation was computed. [2020-07-20 03:36:39,506 INFO L268 CegarLoopResult]: For program point L383(line 383) no Hoare annotation was computed. [2020-07-20 03:36:39,506 INFO L268 CegarLoopResult]: For program point L441(lines 441 445) no Hoare annotation was computed. [2020-07-20 03:36:39,506 INFO L268 CegarLoopResult]: For program point L342(lines 328 411) no Hoare annotation was computed. [2020-07-20 03:36:39,507 INFO L264 CegarLoopResult]: At program point L367(lines 366 407) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-20 03:36:39,507 INFO L264 CegarLoopResult]: At program point L326(line 326) the Hoare annotation is: (or (and (= ~MPR1~0 ~s~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-20 03:36:39,507 INFO L268 CegarLoopResult]: For program point L326-1(lines 322 463) no Hoare annotation was computed. [2020-07-20 03:36:39,507 INFO L268 CegarLoopResult]: For program point L351(lines 351 410) no Hoare annotation was computed. [2020-07-20 03:36:39,507 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 293 464) no Hoare annotation was computed. [2020-07-20 03:36:39,507 INFO L268 CegarLoopResult]: For program point L393(line 393) no Hoare annotation was computed. [2020-07-20 03:36:39,507 INFO L264 CegarLoopResult]: At program point L352(lines 351 410) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-20 03:36:39,508 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 293 464) the Hoare annotation is: (or (and (= ~pended~0 |old(~pended~0)|) (= ~DC~0 |old(~DC~0)|) (= |old(~DevicePowerState~0)| ~DevicePowerState~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~MPR1~0 ~s~0) (= ~compFptr~0 |old(~compFptr~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= |old(~Executive~0)| ~Executive~0) (= ~MPR3~0 |old(~MPR3~0)|)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-20 03:36:39,508 INFO L264 CegarLoopResult]: At program point L443(line 443) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-20 03:36:39,508 INFO L264 CegarLoopResult]: At program point L427(lines 420 460) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= 1 ~pended~0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-20 03:36:39,508 INFO L268 CegarLoopResult]: For program point L361(lines 361 408) no Hoare annotation was computed. [2020-07-20 03:36:39,508 INFO L264 CegarLoopResult]: At program point L328(lines 322 463) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= 1 ~pended~0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-20 03:36:39,508 INFO L268 CegarLoopResult]: For program point L452(lines 452 454) no Hoare annotation was computed. [2020-07-20 03:36:39,508 INFO L264 CegarLoopResult]: At program point L419(lines 412 461) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= 1 ~pended~0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-20 03:36:39,509 INFO L268 CegarLoopResult]: For program point L378(line 378) no Hoare annotation was computed. [2020-07-20 03:36:39,509 INFO L268 CegarLoopResult]: For program point L337(lines 337 340) no Hoare annotation was computed. [2020-07-20 03:36:39,509 INFO L264 CegarLoopResult]: At program point L337-2(lines 337 340) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= 1 ~NP~0) (<= ~NP~0 1) (= ~s~0 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0))) [2020-07-20 03:36:39,509 INFO L268 CegarLoopResult]: For program point L428(lines 412 461) no Hoare annotation was computed. [2020-07-20 03:36:39,509 INFO L264 CegarLoopResult]: At program point L362(lines 361 408) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= 1 ~NP~0) (<= ~NP~0 1) (= ~s~0 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0))) [2020-07-20 03:36:39,509 INFO L268 CegarLoopResult]: For program point L371(lines 371 406) no Hoare annotation was computed. [2020-07-20 03:36:39,509 INFO L268 CegarLoopResult]: For program point L429(lines 429 458) no Hoare annotation was computed. [2020-07-20 03:36:39,510 INFO L268 CegarLoopResult]: For program point L421(lines 421 425) no Hoare annotation was computed. [2020-07-20 03:36:39,510 INFO L268 CegarLoopResult]: For program point L388(line 388) no Hoare annotation was computed. [2020-07-20 03:36:39,510 INFO L268 CegarLoopResult]: For program point L413(lines 413 417) no Hoare annotation was computed. [2020-07-20 03:36:39,510 INFO L264 CegarLoopResult]: At program point L372(lines 371 406) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-20 03:36:39,510 INFO L268 CegarLoopResult]: For program point L430(lines 430 457) no Hoare annotation was computed. [2020-07-20 03:36:39,510 INFO L268 CegarLoopResult]: For program point L356(lines 356 409) no Hoare annotation was computed. [2020-07-20 03:36:39,510 INFO L268 CegarLoopResult]: For program point L447(lines 447 455) no Hoare annotation was computed. [2020-07-20 03:36:39,510 INFO L264 CegarLoopResult]: At program point L439(lines 430 457) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= 1 ~pended~0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-20 03:36:39,511 INFO L268 CegarLoopResult]: For program point L431(lines 431 437) no Hoare annotation was computed. [2020-07-20 03:36:39,511 INFO L268 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2020-07-20 03:36:39,511 INFO L264 CegarLoopResult]: At program point L357(lines 356 409) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2020-07-20 03:36:39,511 INFO L264 CegarLoopResult]: At program point L510(lines 509 524) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= 1 ~NP~0)) (and (= ~MPR1~0 ~s~0) (= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (= ~setEventCalled~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))) (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) .cse0 (not (= 0 ~compRegistered~0))))) [2020-07-20 03:36:39,511 INFO L268 CegarLoopResult]: For program point L539(lines 539 546) no Hoare annotation was computed. [2020-07-20 03:36:39,511 INFO L268 CegarLoopResult]: For program point L502(lines 502 525) no Hoare annotation was computed. [2020-07-20 03:36:39,511 INFO L268 CegarLoopResult]: For program point L531(lines 531 537) no Hoare annotation was computed. [2020-07-20 03:36:39,512 INFO L264 CegarLoopResult]: At program point L544(line 544) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))) (or (not (= ~SKIP1~0 |old(~s~0)|)) .cse0 (not (= 0 ~compRegistered~0))))) [2020-07-20 03:36:39,512 INFO L268 CegarLoopResult]: For program point L544-1(lines 526 548) no Hoare annotation was computed. [2020-07-20 03:36:39,512 INFO L268 CegarLoopResult]: For program point L507(lines 507 524) no Hoare annotation was computed. [2020-07-20 03:36:39,512 INFO L264 CegarLoopResult]: At program point L503(lines 502 525) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) .cse0 (not (= 0 ~compRegistered~0))) (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 (and (= ~MPR1~0 ~s~0) (= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))))) [2020-07-20 03:36:39,513 INFO L264 CegarLoopResult]: At program point IofCallDriverENTRY(lines 479 551) the Hoare annotation is: (let ((.cse0 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse1 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse2 (= 1 ~pended~0))) (and (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= ~s~0 ~NP~0) .cse0 .cse1) .cse2 (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))) (or (not (= ~SKIP1~0 |old(~s~0)|)) (and .cse0 .cse1 (= ~SKIP1~0 ~s~0)) .cse2 (not (= 0 ~compRegistered~0))))) [2020-07-20 03:36:39,513 INFO L264 CegarLoopResult]: At program point L495(line 495) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= ~s~0 |old(~s~0)|) (= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (= ~setEventCalled~0 1)) (not (<= 1 ~compRegistered~0))) (or (not (= ~SKIP1~0 |old(~s~0)|)) .cse0 (not (= 0 ~compRegistered~0))))) [2020-07-20 03:36:39,513 INFO L268 CegarLoopResult]: For program point L487(lines 487 499) no Hoare annotation was computed. [2020-07-20 03:36:39,513 INFO L268 CegarLoopResult]: For program point L487-1(lines 487 499) no Hoare annotation was computed. [2020-07-20 03:36:39,513 INFO L268 CegarLoopResult]: For program point IofCallDriverFINAL(lines 479 551) no Hoare annotation was computed. [2020-07-20 03:36:39,514 INFO L264 CegarLoopResult]: At program point L508(lines 507 524) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) .cse0 (not (= 0 ~compRegistered~0))) (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 (not (= ~NP~0 |old(~s~0)|)) (and (= ~MPR1~0 ~s~0) (= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))))) [2020-07-20 03:36:39,514 INFO L268 CegarLoopResult]: For program point IofCallDriverEXIT(lines 479 551) no Hoare annotation was computed. [2020-07-20 03:36:39,514 INFO L268 CegarLoopResult]: For program point L530(lines 530 547) no Hoare annotation was computed. [2020-07-20 03:36:39,514 INFO L268 CegarLoopResult]: For program point L493(lines 493 497) no Hoare annotation was computed. [2020-07-20 03:36:39,514 INFO L264 CegarLoopResult]: At program point L522(lines 486 550) the Hoare annotation is: (let ((.cse2 (= 1 ~pended~0))) (and (let ((.cse0 (= ~MPR1~0 ~s~0)) (.cse1 (= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)))) (or (not (<= 1 ~NP~0)) (and (<= 0 IofCallDriver_~returnVal2~0) .cse0 (<= IofCallDriver_~returnVal2~0 0) .cse1) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse2 (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (and (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse0 .cse1) (and .cse0 (<= 259 IofCallDriver_~returnVal2~0) .cse1 (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0)))) (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) .cse2 (not (= 0 ~compRegistered~0))))) [2020-07-20 03:36:39,515 INFO L264 CegarLoopResult]: At program point L489(line 489) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) .cse0 (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))) (or (not (= ~SKIP1~0 |old(~s~0)|)) .cse0 (not (= 0 ~compRegistered~0))))) [2020-07-20 03:36:39,515 INFO L268 CegarLoopResult]: For program point L489-1(line 489) no Hoare annotation was computed. [2020-07-20 03:36:39,515 INFO L264 CegarLoopResult]: At program point L473(line 473) the Hoare annotation is: (or (not (= 1 ~setEventCalled~0)) (not (<= ~NP~0 1)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~NP~0 4) ~MPR1~0))) [2020-07-20 03:36:39,515 INFO L264 CegarLoopResult]: At program point stubMoreProcessingRequiredENTRY(lines 465 478) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= ~s~0 ~NP~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= ~setEventCalled~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~compRegistered~0))) [2020-07-20 03:36:39,515 INFO L268 CegarLoopResult]: For program point L473-1(lines 465 478) no Hoare annotation was computed. [2020-07-20 03:36:39,516 INFO L268 CegarLoopResult]: For program point stubMoreProcessingRequiredEXIT(lines 465 478) no Hoare annotation was computed. [2020-07-20 03:36:39,516 INFO L268 CegarLoopResult]: For program point L795(lines 795 815) no Hoare annotation was computed. [2020-07-20 03:36:39,516 INFO L268 CegarLoopResult]: For program point L758(lines 758 762) no Hoare annotation was computed. [2020-07-20 03:36:39,517 INFO L264 CegarLoopResult]: At program point L787(lines 751 818) the Hoare annotation is: (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0))) [2020-07-20 03:36:39,517 INFO L268 CegarLoopResult]: For program point PoCallDriverEXIT(lines 743 819) no Hoare annotation was computed. [2020-07-20 03:36:39,517 INFO L264 CegarLoopResult]: At program point L754(line 754) the Hoare annotation is: (or (not (= ~SKIP1~0 |old(~s~0)|)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0))) [2020-07-20 03:36:39,517 INFO L268 CegarLoopResult]: For program point L754-1(line 754) no Hoare annotation was computed. [2020-07-20 03:36:39,517 INFO L264 CegarLoopResult]: At program point L812(line 812) the Hoare annotation is: (or (not (= ~SKIP1~0 |old(~s~0)|)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0))) [2020-07-20 03:36:39,517 INFO L268 CegarLoopResult]: For program point L812-1(lines 791 816) no Hoare annotation was computed. [2020-07-20 03:36:39,517 INFO L264 CegarLoopResult]: At program point L775(lines 774 789) the Hoare annotation is: (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0))) [2020-07-20 03:36:39,517 INFO L268 CegarLoopResult]: For program point L767(lines 767 790) no Hoare annotation was computed. [2020-07-20 03:36:39,517 INFO L268 CegarLoopResult]: For program point PoCallDriverFINAL(lines 743 819) no Hoare annotation was computed. [2020-07-20 03:36:39,518 INFO L264 CegarLoopResult]: At program point PoCallDriverENTRY(lines 743 819) the Hoare annotation is: (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0))) [2020-07-20 03:36:39,518 INFO L268 CegarLoopResult]: For program point L772(lines 772 789) no Hoare annotation was computed. [2020-07-20 03:36:39,518 INFO L264 CegarLoopResult]: At program point L768(lines 767 790) the Hoare annotation is: (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0))) [2020-07-20 03:36:39,518 INFO L264 CegarLoopResult]: At program point L760(line 760) the Hoare annotation is: (or (not (= ~SKIP1~0 |old(~s~0)|)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0))) [2020-07-20 03:36:39,518 INFO L268 CegarLoopResult]: For program point L752(lines 752 764) no Hoare annotation was computed. [2020-07-20 03:36:39,518 INFO L268 CegarLoopResult]: For program point L752-1(lines 752 764) no Hoare annotation was computed. [2020-07-20 03:36:39,518 INFO L264 CegarLoopResult]: At program point L773(lines 772 789) the Hoare annotation is: (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0))) [2020-07-20 03:36:39,518 INFO L268 CegarLoopResult]: For program point L798(lines 798 804) no Hoare annotation was computed. [2020-07-20 03:36:39,518 INFO L268 CegarLoopResult]: For program point L807(lines 807 814) no Hoare annotation was computed. [2020-07-20 03:36:39,519 INFO L268 CegarLoopResult]: For program point L636(lines 636 654) no Hoare annotation was computed. [2020-07-20 03:36:39,519 INFO L268 CegarLoopResult]: For program point KbFilter_CreateCloseEXIT(lines 627 662) no Hoare annotation was computed. [2020-07-20 03:36:39,519 INFO L264 CegarLoopResult]: At program point L651(lines 639 653) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|))) [2020-07-20 03:36:39,519 INFO L264 CegarLoopResult]: At program point L643(lines 636 654) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|))) [2020-07-20 03:36:39,519 INFO L268 CegarLoopResult]: For program point L639(lines 639 653) no Hoare annotation was computed. [2020-07-20 03:36:39,519 INFO L264 CegarLoopResult]: At program point KbFilter_CreateCloseENTRY(lines 627 662) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|))) [2020-07-20 03:36:39,519 INFO L264 CegarLoopResult]: At program point L658(line 658) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|))) [2020-07-20 03:36:39,519 INFO L268 CegarLoopResult]: For program point L658-1(line 658) no Hoare annotation was computed. [2020-07-20 03:36:39,520 INFO L268 CegarLoopResult]: For program point KbFilter_CreateCloseFINAL(lines 627 662) no Hoare annotation was computed. [2020-07-20 03:36:39,520 INFO L268 CegarLoopResult]: For program point L642(lines 642 652) no Hoare annotation was computed. [2020-07-20 03:36:39,520 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-20 03:36:39,520 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~pended~0 |old(~pended~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= ~NP~0 |old(~NP~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= ~Executive~0 |old(~Executive~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~s~0 |old(~s~0)|) (= ~DC~0 |old(~DC~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~DevicePowerState~0 |old(~DevicePowerState~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= ~SKIP1~0 |old(~SKIP1~0)|) (= ~MPR3~0 |old(~MPR3~0)|)) [2020-07-20 03:36:39,520 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-20 03:36:39,520 INFO L268 CegarLoopResult]: For program point L894(lines 894 982) no Hoare annotation was computed. [2020-07-20 03:36:39,520 INFO L264 CegarLoopResult]: At program point L890(lines 889 984) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|))) [2020-07-20 03:36:39,521 INFO L268 CegarLoopResult]: For program point L915(lines 915 976) no Hoare annotation was computed. [2020-07-20 03:36:39,521 INFO L264 CegarLoopResult]: At program point L882(lines 881 986) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|))) [2020-07-20 03:36:39,521 INFO L268 CegarLoopResult]: For program point KbFilter_InternIoCtlEXIT(lines 820 1005) no Hoare annotation was computed. [2020-07-20 03:36:39,521 INFO L268 CegarLoopResult]: For program point L932(lines 932 971) no Hoare annotation was computed. [2020-07-20 03:36:39,521 INFO L268 CegarLoopResult]: For program point L957-1(lines 957 959) no Hoare annotation was computed. [2020-07-20 03:36:39,521 INFO L268 CegarLoopResult]: For program point L908(lines 908 978) no Hoare annotation was computed. [2020-07-20 03:36:39,521 INFO L264 CegarLoopResult]: At program point L970(lines 865 1004) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|))) [2020-07-20 03:36:39,521 INFO L264 CegarLoopResult]: At program point L933(lines 873 988) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|))) [2020-07-20 03:36:39,522 INFO L264 CegarLoopResult]: At program point L995(line 995) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|))) [2020-07-20 03:36:39,522 INFO L268 CegarLoopResult]: For program point L995-1(line 995) no Hoare annotation was computed. [2020-07-20 03:36:39,522 INFO L268 CegarLoopResult]: For program point L929(lines 929 972) no Hoare annotation was computed. [2020-07-20 03:36:39,522 INFO L268 CegarLoopResult]: For program point L954(lines 954 956) no Hoare annotation was computed. [2020-07-20 03:36:39,522 INFO L268 CegarLoopResult]: For program point L954-2(lines 932 969) no Hoare annotation was computed. [2020-07-20 03:36:39,522 INFO L268 CegarLoopResult]: For program point L938(lines 938 941) no Hoare annotation was computed. [2020-07-20 03:36:39,522 INFO L268 CegarLoopResult]: For program point L901(lines 901 980) no Hoare annotation was computed. [2020-07-20 03:36:39,522 INFO L268 CegarLoopResult]: For program point L922(lines 922 974) no Hoare annotation was computed. [2020-07-20 03:36:39,522 INFO L268 CegarLoopResult]: For program point L889(lines 889 984) no Hoare annotation was computed. [2020-07-20 03:36:39,523 INFO L264 CegarLoopResult]: At program point KbFilter_InternIoCtlENTRY(lines 820 1005) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|))) [2020-07-20 03:36:39,523 INFO L268 CegarLoopResult]: For program point L881(lines 881 986) no Hoare annotation was computed. [2020-07-20 03:36:39,523 INFO L268 CegarLoopResult]: For program point L873(lines 873 988) no Hoare annotation was computed. [2020-07-20 03:36:39,523 INFO L264 CegarLoopResult]: At program point L1001(line 1001) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|))) [2020-07-20 03:36:39,523 INFO L268 CegarLoopResult]: For program point L1001-1(line 1001) no Hoare annotation was computed. [2020-07-20 03:36:39,523 INFO L268 CegarLoopResult]: For program point KbFilter_InternIoCtlFINAL(lines 820 1005) no Hoare annotation was computed. [2020-07-20 03:36:39,523 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectEXIT(lines 574 615) no Hoare annotation was computed. [2020-07-20 03:36:39,523 INFO L268 CegarLoopResult]: For program point L601(lines 601 613) no Hoare annotation was computed. [2020-07-20 03:36:39,524 INFO L264 CegarLoopResult]: At program point L587(lines 579 598) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse3 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3) (or (not (= 1 |old(~setEventCalled~0)|)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) .cse0 .cse1 (not (<= ~NP~0 1)) .cse2 .cse3))) [2020-07-20 03:36:39,524 INFO L268 CegarLoopResult]: For program point L579(lines 579 598) no Hoare annotation was computed. [2020-07-20 03:36:39,524 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectFINAL(lines 574 615) no Hoare annotation was computed. [2020-07-20 03:36:39,524 INFO L264 CegarLoopResult]: At program point L604(lines 603 613) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse2 (= 1 ~pended~0)) (.cse3 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse4 (not (<= 1 ~compRegistered~0)))) (and (or (not (= 1 |old(~setEventCalled~0)|)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) .cse0 .cse1 .cse2 (not (<= ~NP~0 1)) .cse3 .cse4) (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4))) [2020-07-20 03:36:39,524 INFO L264 CegarLoopResult]: At program point L602(lines 601 613) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse2 (= 1 ~pended~0)) (.cse3 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse4 (not (<= 1 ~compRegistered~0)))) (and (or (not (= 1 |old(~setEventCalled~0)|)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) .cse0 .cse1 .cse2 (not (<= ~NP~0 1)) .cse3 .cse4) (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4))) [2020-07-20 03:36:39,524 INFO L264 CegarLoopResult]: At program point L594(line 594) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 1 ~compRegistered~0))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0)))) (and (or (not (= |old(~s~0)| ~NP~0)) .cse0 .cse1 .cse2 .cse3) (or (not (= 1 |old(~setEventCalled~0)|)) (not (<= ~NP~0 1)) .cse0 (not (<= 1 ~NP~0)) .cse1 (not (= |old(~s~0)| ~MPR3~0)) .cse2 .cse3))) [2020-07-20 03:36:39,525 INFO L268 CegarLoopResult]: For program point L592(lines 592 596) no Hoare annotation was computed. [2020-07-20 03:36:39,525 INFO L268 CegarLoopResult]: For program point L592-1(lines 579 598) no Hoare annotation was computed. [2020-07-20 03:36:39,525 INFO L264 CegarLoopResult]: At program point KeWaitForSingleObjectENTRY(lines 574 615) the Hoare annotation is: (let ((.cse0 (= |old(~customIrp~0)| ~customIrp~0)) (.cse1 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse2 (= 1 ~pended~0)) (.cse3 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse4 (not (<= 1 ~compRegistered~0)))) (and (or (not (= 1 |old(~setEventCalled~0)|)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) (and (= ~MPR3~0 ~s~0) (= ~setEventCalled~0 1) .cse0) .cse1 .cse2 (not (<= ~NP~0 1)) .cse3 .cse4) (or (and (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) .cse0) .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4))) [2020-07-20 03:36:39,525 INFO L268 CegarLoopResult]: For program point L580(lines 580 585) no Hoare annotation was computed. [2020-07-20 03:36:39,525 INFO L264 CegarLoopResult]: At program point L560(line 560) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0)) (.cse1 (not (= ~NP~0 |old(~s~0)|)))) (and (or .cse0 .cse1 (not (<= 1 ~compRegistered~0))) (or .cse0 (not (= 0 ~compRegistered~0)) .cse1))) [2020-07-20 03:36:39,525 INFO L268 CegarLoopResult]: For program point L560-1(lines 552 565) no Hoare annotation was computed. [2020-07-20 03:36:39,525 INFO L268 CegarLoopResult]: For program point L556(lines 556 562) no Hoare annotation was computed. [2020-07-20 03:36:39,526 INFO L264 CegarLoopResult]: At program point IofCompleteRequestENTRY(lines 552 565) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0)) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse1 (= ~s~0 |old(~s~0)|))) (and (or .cse0 (not (= 0 ~compRegistered~0)) .cse1 .cse2) (or .cse0 .cse2 .cse1 (not (<= 1 ~compRegistered~0))))) [2020-07-20 03:36:39,526 INFO L268 CegarLoopResult]: For program point IofCompleteRequestEXIT(lines 552 565) no Hoare annotation was computed. [2020-07-20 03:36:39,526 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-20 03:36:39,527 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~MPR1~0 ~s~0) (not (= 1 ~pended~0)) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) [2020-07-20 03:36:39,527 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-20 03:36:39,527 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-20 03:36:39,527 INFO L264 CegarLoopResult]: At program point KbFilter_DispatchPassThroughENTRY(lines 663 686) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|))) [2020-07-20 03:36:39,527 INFO L268 CegarLoopResult]: For program point L672(lines 672 678) no Hoare annotation was computed. [2020-07-20 03:36:39,528 INFO L264 CegarLoopResult]: At program point L682(line 682) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) [2020-07-20 03:36:39,528 INFO L268 CegarLoopResult]: For program point L682-1(line 682) no Hoare annotation was computed. [2020-07-20 03:36:39,528 INFO L268 CegarLoopResult]: For program point KbFilter_DispatchPassThroughFINAL(lines 663 686) no Hoare annotation was computed. [2020-07-20 03:36:39,528 INFO L264 CegarLoopResult]: At program point L676(line 676) the Hoare annotation is: (or (= 1 ~pended~0) (not (= 0 ~compRegistered~0)) (not (= ~NP~0 |old(~s~0)|))) [2020-07-20 03:36:39,528 INFO L268 CegarLoopResult]: For program point KbFilter_DispatchPassThroughEXIT(lines 663 686) no Hoare annotation was computed. [2020-07-20 03:36:39,528 INFO L268 CegarLoopResult]: For program point L676-1(lines 672 678) no Hoare annotation was computed. [2020-07-20 03:36:39,528 INFO L264 CegarLoopResult]: At program point L225(line 225) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-20 03:36:39,528 INFO L264 CegarLoopResult]: At program point L192(lines 192 193) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= KbFilter_PnP_~status~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (<= 1 ~compRegistered~0))) [2020-07-20 03:36:39,529 INFO L268 CegarLoopResult]: For program point L225-1(lines 221 227) no Hoare annotation was computed. [2020-07-20 03:36:39,529 INFO L268 CegarLoopResult]: For program point L192-1(lines 192 193) no Hoare annotation was computed. [2020-07-20 03:36:39,529 INFO L268 CegarLoopResult]: For program point L151(lines 151 274) no Hoare annotation was computed. [2020-07-20 03:36:39,529 INFO L268 CegarLoopResult]: For program point L118(lines 118 285) no Hoare annotation was computed. [2020-07-20 03:36:39,529 INFO L264 CegarLoopResult]: At program point L110(lines 109 288) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= 0 ~compRegistered~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-20 03:36:39,529 INFO L271 CegarLoopResult]: At program point L267(lines 170 268) the Hoare annotation is: true [2020-07-20 03:36:39,529 INFO L268 CegarLoopResult]: For program point L160(lines 160 271) no Hoare annotation was computed. [2020-07-20 03:36:39,529 INFO L268 CegarLoopResult]: For program point L127(lines 127 282) no Hoare annotation was computed. [2020-07-20 03:36:39,530 INFO L264 CegarLoopResult]: At program point L177(line 177) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-20 03:36:39,530 INFO L264 CegarLoopResult]: At program point L169(lines 115 286) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= 0 ~compRegistered~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-20 03:36:39,530 INFO L268 CegarLoopResult]: For program point L136(lines 136 279) no Hoare annotation was computed. [2020-07-20 03:36:39,530 INFO L268 CegarLoopResult]: For program point KbFilter_PnPEXIT(lines 79 292) no Hoare annotation was computed. [2020-07-20 03:36:39,530 INFO L268 CegarLoopResult]: For program point L145(lines 145 276) no Hoare annotation was computed. [2020-07-20 03:36:39,530 INFO L268 CegarLoopResult]: For program point L112(lines 112 287) no Hoare annotation was computed. [2020-07-20 03:36:39,530 INFO L268 CegarLoopResult]: For program point L154(lines 154 273) no Hoare annotation was computed. [2020-07-20 03:36:39,530 INFO L268 CegarLoopResult]: For program point L121(lines 121 284) no Hoare annotation was computed. [2020-07-20 03:36:39,531 INFO L264 CegarLoopResult]: At program point L113(lines 112 287) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|) (= 0 ~compRegistered~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-20 03:36:39,531 INFO L264 CegarLoopResult]: At program point KbFilter_PnPENTRY(lines 79 292) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-20 03:36:39,531 INFO L268 CegarLoopResult]: For program point L237(lines 237 243) no Hoare annotation was computed. [2020-07-20 03:36:39,531 INFO L268 CegarLoopResult]: For program point KbFilter_PnPFINAL(lines 79 292) no Hoare annotation was computed. [2020-07-20 03:36:39,531 INFO L264 CegarLoopResult]: At program point L262(lines 262 263) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-20 03:36:39,531 INFO L268 CegarLoopResult]: For program point L262-1(lines 262 263) no Hoare annotation was computed. [2020-07-20 03:36:39,531 INFO L268 CegarLoopResult]: For program point L163(lines 163 270) no Hoare annotation was computed. [2020-07-20 03:36:39,531 INFO L268 CegarLoopResult]: For program point L130(lines 130 281) no Hoare annotation was computed. [2020-07-20 03:36:39,531 INFO L268 CegarLoopResult]: For program point L221(lines 221 227) no Hoare annotation was computed. [2020-07-20 03:36:39,532 INFO L268 CegarLoopResult]: For program point L180(lines 180 186) no Hoare annotation was computed. [2020-07-20 03:36:39,532 INFO L268 CegarLoopResult]: For program point L180-1(lines 175 187) no Hoare annotation was computed. [2020-07-20 03:36:39,532 INFO L268 CegarLoopResult]: For program point L205(lines 205 211) no Hoare annotation was computed. [2020-07-20 03:36:39,532 INFO L268 CegarLoopResult]: For program point L139(lines 139 278) no Hoare annotation was computed. [2020-07-20 03:36:39,532 INFO L268 CegarLoopResult]: For program point L106(lines 106 289) no Hoare annotation was computed. [2020-07-20 03:36:39,532 INFO L268 CegarLoopResult]: For program point L197(lines 197 203) no Hoare annotation was computed. [2020-07-20 03:36:39,532 INFO L268 CegarLoopResult]: For program point L197-2(lines 170 266) no Hoare annotation was computed. [2020-07-20 03:36:39,532 INFO L264 CegarLoopResult]: At program point L247(line 247) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-20 03:36:39,532 INFO L268 CegarLoopResult]: For program point L247-1(line 247) no Hoare annotation was computed. [2020-07-20 03:36:39,533 INFO L268 CegarLoopResult]: For program point L148(lines 148 275) no Hoare annotation was computed. [2020-07-20 03:36:39,533 INFO L268 CegarLoopResult]: For program point L115(lines 115 286) no Hoare annotation was computed. [2020-07-20 03:36:39,533 INFO L268 CegarLoopResult]: For program point L206(lines 206 210) no Hoare annotation was computed. [2020-07-20 03:36:39,533 INFO L264 CegarLoopResult]: At program point L107(lines 106 289) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (and (= KbFilter_PnP_~status~0 0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-20 03:36:39,533 INFO L264 CegarLoopResult]: At program point L231(lines 231 232) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-20 03:36:39,533 INFO L268 CegarLoopResult]: For program point L231-1(lines 231 232) no Hoare annotation was computed. [2020-07-20 03:36:39,533 INFO L264 CegarLoopResult]: At program point L256(line 256) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-20 03:36:39,533 INFO L268 CegarLoopResult]: For program point L256-1(lines 252 258) no Hoare annotation was computed. [2020-07-20 03:36:39,534 INFO L268 CegarLoopResult]: For program point L157(lines 157 272) no Hoare annotation was computed. [2020-07-20 03:36:39,534 INFO L268 CegarLoopResult]: For program point L124(lines 124 283) no Hoare annotation was computed. [2020-07-20 03:36:39,534 INFO L264 CegarLoopResult]: At program point L182(line 182) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-20 03:36:39,534 INFO L264 CegarLoopResult]: At program point L199(lines 199 201) the Hoare annotation is: (let ((.cse0 (<= 1 ~compRegistered~0))) (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (and (= 259 KbFilter_PnP_~__cil_tmp23~0) (<= 259 KbFilter_PnP_~status~0) (= ~MPR3~0 ~s~0) (= ~setEventCalled~0 1) .cse0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= ~s~0 |old(~s~0)|) .cse0))) [2020-07-20 03:36:39,534 INFO L268 CegarLoopResult]: For program point L166(lines 166 269) no Hoare annotation was computed. [2020-07-20 03:36:39,534 INFO L268 CegarLoopResult]: For program point L199-1(lines 199 201) no Hoare annotation was computed. [2020-07-20 03:36:39,534 INFO L268 CegarLoopResult]: For program point L133(lines 133 280) no Hoare annotation was computed. [2020-07-20 03:36:39,534 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0))) [2020-07-20 03:36:39,535 INFO L264 CegarLoopResult]: At program point L241(line 241) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= ~NP~0 1)) (not (= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0))) [2020-07-20 03:36:39,535 INFO L268 CegarLoopResult]: For program point L241-1(lines 237 243) no Hoare annotation was computed. [2020-07-20 03:36:39,535 INFO L268 CegarLoopResult]: For program point L175(lines 175 187) no Hoare annotation was computed. [2020-07-20 03:36:39,535 INFO L268 CegarLoopResult]: For program point L142(lines 142 277) no Hoare annotation was computed. [2020-07-20 03:36:39,535 INFO L268 CegarLoopResult]: For program point L109(lines 109 288) no Hoare annotation was computed. [2020-07-20 03:36:39,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 03:36:39 BoogieIcfgContainer [2020-07-20 03:36:39,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 03:36:39,621 INFO L168 Benchmark]: Toolchain (without parser) took 22110.60 ms. Allocated memory was 140.0 MB in the beginning and 493.4 MB in the end (delta: 353.4 MB). Free memory was 104.5 MB in the beginning and 314.3 MB in the end (delta: -209.7 MB). Peak memory consumption was 346.1 MB. Max. memory is 7.1 GB. [2020-07-20 03:36:39,625 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 140.0 MB. Free memory is still 122.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-20 03:36:39,625 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.57 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 104.1 MB in the beginning and 176.9 MB in the end (delta: -72.8 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. [2020-07-20 03:36:39,626 INFO L168 Benchmark]: Boogie Preprocessor took 74.69 ms. Allocated memory is still 203.9 MB. Free memory was 176.9 MB in the beginning and 173.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-07-20 03:36:39,626 INFO L168 Benchmark]: RCFGBuilder took 1103.83 ms. Allocated memory is still 203.9 MB. Free memory was 173.5 MB in the beginning and 102.8 MB in the end (delta: 70.7 MB). Peak memory consumption was 70.7 MB. Max. memory is 7.1 GB. [2020-07-20 03:36:39,627 INFO L168 Benchmark]: TraceAbstraction took 20306.48 ms. Allocated memory was 203.9 MB in the beginning and 493.4 MB in the end (delta: 289.4 MB). Free memory was 102.2 MB in the beginning and 314.3 MB in the end (delta: -212.1 MB). Peak memory consumption was 279.7 MB. Max. memory is 7.1 GB. [2020-07-20 03:36:39,631 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 140.0 MB. Free memory is still 122.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 618.57 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 104.1 MB in the beginning and 176.9 MB in the end (delta: -72.8 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.69 ms. Allocated memory is still 203.9 MB. Free memory was 176.9 MB in the beginning and 173.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1103.83 ms. Allocated memory is still 203.9 MB. Free memory was 173.5 MB in the beginning and 102.8 MB in the end (delta: 70.7 MB). Peak memory consumption was 70.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20306.48 ms. Allocated memory was 203.9 MB in the beginning and 493.4 MB in the end (delta: 289.4 MB). Free memory was 102.2 MB in the beginning and 314.3 MB in the end (delta: -212.1 MB). Peak memory consumption was 279.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1011]: 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: 420]: Loop Invariant Derived loop invariant: (((((!(\old(NP) == \old(MPR1)) || !(1 == pended)) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((((!(\old(NP) == \old(MPR1)) || 0 <= status) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 865]: Loop Invariant Derived loop invariant: ((1 == pended || !(0 == compRegistered)) || !(NP == \old(s))) || (((setEventCalled == \old(setEventCalled) && s == \old(s)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: ((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || 1 == pended) || !(0 == compRegistered) - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: ((1 == pended || !(0 == compRegistered)) || !(NP == \old(s))) || (((setEventCalled == \old(setEventCalled) && s == \old(s)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) - InvariantResult [Line: 502]: Loop Invariant Derived loop invariant: (((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || 1 == pended) || !(0 == compRegistered)) && (((((((!(1 <= NP) || !(NP + 4 <= MPR1)) || 1 == pended) || (MPR1 == s && 0 == __cil_tmp7 + 1073741802)) || !(NP == \old(s))) || !(NP <= 1)) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: ((((((((s == NP && 0 <= status) && !(1 == pended)) && 0 == compRegistered) || !(\old(NP) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: ((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || 1 == pended) || !(0 == compRegistered) - InvariantResult [Line: 636]: Loop Invariant Derived loop invariant: ((1 == pended || !(0 == compRegistered)) || !(NP == \old(s))) || (((setEventCalled == \old(setEventCalled) && s == \old(s)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((!(1 <= NP) || (((((setEventCalled == \old(setEventCalled) && s == \old(s)) && 0 == compRegistered) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && lowerDriverReturn == \old(lowerDriverReturn))) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(NP <= 1)) || !(0 == \old(compRegistered))) || !(NP + 5 <= MPR3) - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: ((((setEventCalled == \old(setEventCalled) && s == \old(s)) && lowerDriverReturn == \old(lowerDriverReturn)) || 1 == pended) || !(0 == compRegistered)) || !(NP == \old(s)) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((((((!(1 <= NP) || (((((setEventCalled == \old(setEventCalled) && s == \old(s)) && 0 == compRegistered) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && lowerDriverReturn == \old(lowerDriverReturn))) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(NP <= 1)) || !(0 == \old(compRegistered))) || !(NP + 5 <= MPR3) - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: (((((((((!(1 <= NP) || (((0 <= returnVal2 && MPR1 == s) && returnVal2 <= 0) && 0 == __cil_tmp7 + 1073741802)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(NP <= 1)) || ((returnVal2 + 1073741823 <= 0 && MPR1 == s) && 0 == __cil_tmp7 + 1073741802)) || ((((MPR1 == s && 259 <= returnVal2) && 0 == __cil_tmp7 + 1073741802) && setEventCalled == 1) && returnVal2 <= 259)) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) && (((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || 1 == pended) || !(0 == compRegistered)) - InvariantResult [Line: 873]: Loop Invariant Derived loop invariant: ((1 == pended || !(0 == compRegistered)) || !(NP == \old(s))) || (((setEventCalled == \old(setEventCalled) && s == \old(s)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) - InvariantResult [Line: 601]: Loop Invariant Derived loop invariant: ((((((((!(1 == \old(setEventCalled)) || !(MPR3 == \old(s))) || !(1 <= NP)) || s == NP) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP <= 1)) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) && (((((s == NP || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: ((((((((!(1 == \old(setEventCalled)) || !(MPR3 == \old(s))) || !(1 <= NP)) || s == NP) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP <= 1)) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) && (((((s == NP || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((!(\old(NP) == \old(MPR1)) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || (((((((1 <= NP && NP <= 1) && s == NP) && NP + 5 <= MPR3) && 0 <= status) && !(1 == pended)) && 0 == compRegistered) && NP + 4 <= MPR1) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((!(1 <= NP) || ((((((status == 0 && \old(compRegistered) == compRegistered) && s == NP) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && lowerDriverReturn == \old(lowerDriverReturn))) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(NP <= 1)) || !(0 == \old(compRegistered))) || !(NP + 5 <= MPR3) - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: (((((!(\old(NP) == \old(MPR1)) || !(1 == pended)) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 639]: Loop Invariant Derived loop invariant: ((1 == pended || !(0 == compRegistered)) || !(NP == \old(s))) || (((setEventCalled == \old(setEventCalled) && s == \old(s)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: ((((setEventCalled == \old(setEventCalled) && s == \old(s)) && lowerDriverReturn == \old(lowerDriverReturn)) || 1 == pended) || !(0 == compRegistered)) || !(NP == \old(s)) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: (((((!(\old(NP) == \old(MPR1)) || !(1 == pended)) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 751]: Loop Invariant Derived loop invariant: ((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || 1 == pended) || !(0 == compRegistered) - InvariantResult [Line: 579]: Loop Invariant Derived loop invariant: (((((!(NP + 4 <= MPR1) || ((setEventCalled == \old(setEventCalled) && s == \old(s)) && \old(customIrp) == customIrp)) || 1 == pended) || !(NP == \old(s))) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) && (((((((!(1 == \old(setEventCalled)) || !(MPR3 == \old(s))) || !(1 <= NP)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP <= 1)) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((((((((s == NP && 0 <= status) && !(1 == pended)) && 0 == compRegistered) || !(\old(NP) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((!(1 <= NP) || ((MPR1 == s && 0 == __cil_tmp7 + 1073741802) && setEventCalled == 1)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(NP <= 1)) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) && (((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || 1 == pended) || !(0 == compRegistered)) - InvariantResult [Line: 889]: Loop Invariant Derived loop invariant: ((1 == pended || !(0 == compRegistered)) || !(NP == \old(s))) || (((setEventCalled == \old(setEventCalled) && s == \old(s)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((((!(\old(NP) == \old(MPR1)) || !(1 == pended)) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 767]: Loop Invariant Derived loop invariant: ((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || 1 == pended) || !(0 == compRegistered) - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: (((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || 1 == pended) || !(0 == compRegistered)) && (((((((!(1 <= NP) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || (MPR1 == s && 0 == __cil_tmp7 + 1073741802)) || !(NP <= 1)) || !(NP + 5 <= MPR3)) || !(1 <= compRegistered)) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: ((((((((s == NP && 0 <= status) && !(1 == pended)) && 0 == compRegistered) || !(\old(NP) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((((!(1 <= NP) || (((((setEventCalled == \old(setEventCalled) && s == \old(s)) && 0 == compRegistered) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && lowerDriverReturn == \old(lowerDriverReturn))) || !(NP + 4 <= MPR1)) || 1 == pended) || !(NP == \old(s))) || !(NP <= 1)) || !(0 == \old(compRegistered))) || !(NP + 5 <= MPR3) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: ((((((((s == NP && 0 <= status) && !(1 == pended)) && 0 == compRegistered) || !(\old(NP) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 239 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2605 SDtfs, 3356 SDslu, 3180 SDs, 0 SdLazy, 4898 SolverSat, 816 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 177 SyntacticMatches, 5 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred 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.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 145 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 324 PreInvPairs, 398 NumberOfFragments, 3099 HoareAnnotationTreeSize, 324 FomulaSimplifications, 504 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 84 FomulaSimplificationsInter, 3632 FormulaSimplificationTreeSizeReductionInter, 4.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 210010 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...