/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.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-89f541c [2020-08-27 21:50:27,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-27 21:50:27,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-27 21:50:27,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-27 21:50:27,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-27 21:50:27,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-27 21:50:27,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-27 21:50:27,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-27 21:50:27,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-27 21:50:27,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-27 21:50:27,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-27 21:50:27,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-27 21:50:27,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-27 21:50:27,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-27 21:50:27,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-27 21:50:27,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-27 21:50:27,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-27 21:50:27,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-27 21:50:27,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-27 21:50:27,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-27 21:50:27,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-27 21:50:27,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-27 21:50:27,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-27 21:50:27,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-27 21:50:27,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-27 21:50:27,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-27 21:50:27,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-27 21:50:27,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-27 21:50:27,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-27 21:50:27,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-27 21:50:27,991 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-27 21:50:27,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-27 21:50:27,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-27 21:50:27,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-27 21:50:27,998 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-27 21:50:27,998 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-27 21:50:27,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-27 21:50:27,999 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-27 21:50:27,999 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-27 21:50:28,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-27 21:50:28,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-27 21:50:28,004 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-27 21:50:28,066 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-27 21:50:28,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-27 21:50:28,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-27 21:50:28,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-27 21:50:28,068 INFO L138 SettingsManager]: * Use SBE=true [2020-08-27 21:50:28,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-27 21:50:28,070 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-27 21:50:28,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-27 21:50:28,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-27 21:50:28,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-27 21:50:28,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-27 21:50:28,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-27 21:50:28,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-27 21:50:28,071 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-27 21:50:28,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-27 21:50:28,072 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-27 21:50:28,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-27 21:50:28,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-27 21:50:28,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-27 21:50:28,072 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-27 21:50:28,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-27 21:50:28,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-27 21:50:28,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-27 21:50:28,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-27 21:50:28,073 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-27 21:50:28,075 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-27 21:50:28,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-27 21:50:28,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-27 21:50:28,075 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-27 21:50:28,076 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-08-27 21:50:28,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-27 21:50:28,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-27 21:50:28,582 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-27 21:50:28,584 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-27 21:50:28,584 INFO L275 PluginConnector]: CDTParser initialized [2020-08-27 21:50:28,586 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-08-27 21:50:28,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a814055a9/602cb1e52a0c4d48b1f52c94ca2aed42/FLAG783279545 [2020-08-27 21:50:29,243 INFO L306 CDTParser]: Found 1 translation units. [2020-08-27 21:50:29,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-08-27 21:50:29,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a814055a9/602cb1e52a0c4d48b1f52c94ca2aed42/FLAG783279545 [2020-08-27 21:50:29,561 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a814055a9/602cb1e52a0c4d48b1f52c94ca2aed42 [2020-08-27 21:50:29,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-27 21:50:29,577 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-27 21:50:29,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-27 21:50:29,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-27 21:50:29,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-27 21:50:29,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:50:29" (1/1) ... [2020-08-27 21:50:29,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d574d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:50:29, skipping insertion in model container [2020-08-27 21:50:29,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:50:29" (1/1) ... [2020-08-27 21:50:29,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-27 21:50:29,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-27 21:50:30,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:50:30,054 INFO L203 MainTranslator]: Completed pre-run [2020-08-27 21:50:30,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:50:30,210 INFO L208 MainTranslator]: Completed translation [2020-08-27 21:50:30,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:50:30 WrapperNode [2020-08-27 21:50:30,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-27 21:50:30,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-27 21:50:30,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-27 21:50:30,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-27 21:50:30,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:50:30" (1/1) ... [2020-08-27 21:50:30,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:50:30" (1/1) ... [2020-08-27 21:50:30,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:50:30" (1/1) ... [2020-08-27 21:50:30,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:50:30" (1/1) ... [2020-08-27 21:50:30,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:50:30" (1/1) ... [2020-08-27 21:50:30,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:50:30" (1/1) ... [2020-08-27 21:50:30,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:50:30" (1/1) ... [2020-08-27 21:50:30,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-27 21:50:30,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-27 21:50:30,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-27 21:50:30,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-27 21:50:30,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:50:30" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-08-27 21:50:30,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-27 21:50:30,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-27 21:50:30,362 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-08-27 21:50:30,362 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-08-27 21:50:30,362 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2020-08-27 21:50:30,363 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-27 21:50:30,363 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-08-27 21:50:30,363 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-08-27 21:50:30,363 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-08-27 21:50:30,363 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-08-27 21:50:30,364 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-08-27 21:50:30,364 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2020-08-27 21:50:30,364 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-08-27 21:50:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-27 21:50:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-08-27 21:50:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-27 21:50:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-08-27 21:50:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2020-08-27 21:50:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-08-27 21:50:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-08-27 21:50:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-08-27 21:50:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2020-08-27 21:50:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-08-27 21:50:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-08-27 21:50:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-08-27 21:50:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-08-27 21:50:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-27 21:50:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-08-27 21:50:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-27 21:50:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-27 21:50:30,646 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-27 21:50:30,756 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2020-08-27 21:50:30,756 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2020-08-27 21:50:30,759 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-27 21:50:30,802 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2020-08-27 21:50:30,802 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2020-08-27 21:50:30,817 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-27 21:50:30,842 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-08-27 21:50:30,842 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-08-27 21:50:30,860 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-27 21:50:30,996 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2020-08-27 21:50:30,997 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2020-08-27 21:50:31,022 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-27 21:50:31,023 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-27 21:50:31,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:50:31 BoogieIcfgContainer [2020-08-27 21:50:31,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-27 21:50:31,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-27 21:50:31,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-27 21:50:31,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-27 21:50:31,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 09:50:29" (1/3) ... [2020-08-27 21:50:31,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e620214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:50:31, skipping insertion in model container [2020-08-27 21:50:31,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:50:30" (2/3) ... [2020-08-27 21:50:31,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e620214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:50:31, skipping insertion in model container [2020-08-27 21:50:31,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:50:31" (3/3) ... [2020-08-27 21:50:31,046 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2020-08-27 21:50:31,056 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-27 21:50:31,065 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-27 21:50:31,084 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-27 21:50:31,114 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-27 21:50:31,114 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-27 21:50:31,115 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-27 21:50:31,115 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-27 21:50:31,115 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-27 21:50:31,115 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-27 21:50:31,115 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-27 21:50:31,116 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-27 21:50:31,146 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2020-08-27 21:50:31,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-08-27 21:50:31,156 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:31,158 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-08-27 21:50:31,158 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:31,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:31,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1530382191, now seen corresponding path program 1 times [2020-08-27 21:50:31,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:31,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1229470875] [2020-08-27 21:50:31,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:31,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:31,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:50:31,665 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1229470875] [2020-08-27 21:50:31,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:50:31,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-27 21:50:31,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223448018] [2020-08-27 21:50:31,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:50:31,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:31,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:50:31,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:50:31,700 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2020-08-27 21:50:32,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:32,464 INFO L93 Difference]: Finished difference Result 303 states and 463 transitions. [2020-08-27 21:50:32,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-08-27 21:50:32,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-08-27 21:50:32,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:32,484 INFO L225 Difference]: With dead ends: 303 [2020-08-27 21:50:32,485 INFO L226 Difference]: Without dead ends: 157 [2020-08-27 21:50:32,493 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-08-27 21:50:32,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-08-27 21:50:32,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2020-08-27 21:50:32,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-08-27 21:50:32,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2020-08-27 21:50:32,577 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2020-08-27 21:50:32,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:32,578 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2020-08-27 21:50:32,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:50:32,578 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2020-08-27 21:50:32,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-27 21:50:32,579 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:32,580 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] [2020-08-27 21:50:32,580 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-27 21:50:32,580 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:32,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:32,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1141575010, now seen corresponding path program 1 times [2020-08-27 21:50:32,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:32,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1560240661] [2020-08-27 21:50:32,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:32,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:32,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:32,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:50:33,017 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1560240661] [2020-08-27 21:50:33,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:50:33,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-27 21:50:33,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855369374] [2020-08-27 21:50:33,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-27 21:50:33,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:33,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-27 21:50:33,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:50:33,028 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 6 states. [2020-08-27 21:50:33,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:33,885 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2020-08-27 21:50:33,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:50:33,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-27 21:50:33,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:33,889 INFO L225 Difference]: With dead ends: 275 [2020-08-27 21:50:33,889 INFO L226 Difference]: Without dead ends: 219 [2020-08-27 21:50:33,891 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-08-27 21:50:33,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-08-27 21:50:33,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2020-08-27 21:50:33,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-08-27 21:50:33,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2020-08-27 21:50:33,923 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2020-08-27 21:50:33,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:33,923 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2020-08-27 21:50:33,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-27 21:50:33,924 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2020-08-27 21:50:33,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-27 21:50:33,925 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:33,925 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] [2020-08-27 21:50:33,925 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-27 21:50:33,925 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:33,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:33,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1029098174, now seen corresponding path program 1 times [2020-08-27 21:50:33,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:33,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1185013444] [2020-08-27 21:50:33,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:34,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:34,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:34,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:50:34,126 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1185013444] [2020-08-27 21:50:34,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:50:34,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-27 21:50:34,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482183893] [2020-08-27 21:50:34,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-27 21:50:34,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:34,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-27 21:50:34,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:50:34,128 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand 6 states. [2020-08-27 21:50:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:34,536 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2020-08-27 21:50:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:50:34,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-27 21:50:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:34,539 INFO L225 Difference]: With dead ends: 316 [2020-08-27 21:50:34,539 INFO L226 Difference]: Without dead ends: 254 [2020-08-27 21:50:34,541 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-08-27 21:50:34,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-08-27 21:50:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2020-08-27 21:50:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-08-27 21:50:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2020-08-27 21:50:34,570 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2020-08-27 21:50:34,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:34,571 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2020-08-27 21:50:34,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-27 21:50:34,571 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2020-08-27 21:50:34,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-08-27 21:50:34,574 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:34,574 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] [2020-08-27 21:50:34,575 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-27 21:50:34,576 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:34,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:34,576 INFO L82 PathProgramCache]: Analyzing trace with hash 742933031, now seen corresponding path program 1 times [2020-08-27 21:50:34,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:34,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1978242954] [2020-08-27 21:50:34,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:34,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:34,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:34,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:50:34,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1978242954] [2020-08-27 21:50:34,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:50:34,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-27 21:50:34,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653608119] [2020-08-27 21:50:34,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-27 21:50:34,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:34,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-27 21:50:34,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:50:34,810 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand 6 states. [2020-08-27 21:50:35,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:35,382 INFO L93 Difference]: Finished difference Result 220 states and 291 transitions. [2020-08-27 21:50:35,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:50:35,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-08-27 21:50:35,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:35,385 INFO L225 Difference]: With dead ends: 220 [2020-08-27 21:50:35,385 INFO L226 Difference]: Without dead ends: 217 [2020-08-27 21:50:35,386 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-08-27 21:50:35,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-08-27 21:50:35,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2020-08-27 21:50:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-08-27 21:50:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2020-08-27 21:50:35,437 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2020-08-27 21:50:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:35,443 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2020-08-27 21:50:35,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-27 21:50:35,444 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2020-08-27 21:50:35,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-08-27 21:50:35,448 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:35,448 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-08-27 21:50:35,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-27 21:50:35,449 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:35,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:35,449 INFO L82 PathProgramCache]: Analyzing trace with hash 324263340, now seen corresponding path program 1 times [2020-08-27 21:50:35,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:35,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1399452556] [2020-08-27 21:50:35,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:35,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:35,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:35,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:35,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-27 21:50:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:50:35,687 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1399452556] [2020-08-27 21:50:35,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:50:35,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-27 21:50:35,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172695937] [2020-08-27 21:50:35,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-27 21:50:35,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:35,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-27 21:50:35,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:50:35,689 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand 8 states. [2020-08-27 21:50:36,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:36,415 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2020-08-27 21:50:36,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-27 21:50:36,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-08-27 21:50:36,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:36,424 INFO L225 Difference]: With dead ends: 274 [2020-08-27 21:50:36,425 INFO L226 Difference]: Without dead ends: 208 [2020-08-27 21:50:36,425 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-08-27 21:50:36,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-08-27 21:50:36,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2020-08-27 21:50:36,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-08-27 21:50:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2020-08-27 21:50:36,443 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2020-08-27 21:50:36,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:36,444 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2020-08-27 21:50:36,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-27 21:50:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2020-08-27 21:50:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-27 21:50:36,446 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:36,446 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] [2020-08-27 21:50:36,447 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-27 21:50:36,447 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:36,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:36,448 INFO L82 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 1 times [2020-08-27 21:50:36,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:36,448 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1589802946] [2020-08-27 21:50:36,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:36,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:36,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:36,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:36,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-27 21:50:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:36,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-27 21:50:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:36,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-27 21:50:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:36,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:50:36,656 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1589802946] [2020-08-27 21:50:36,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:50:36,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-27 21:50:36,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965234991] [2020-08-27 21:50:36,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-27 21:50:36,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:36,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-27 21:50:36,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:50:36,658 INFO L87 Difference]: Start difference. First operand 190 states and 250 transitions. Second operand 8 states. [2020-08-27 21:50:37,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:37,196 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2020-08-27 21:50:37,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-27 21:50:37,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-08-27 21:50:37,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:37,200 INFO L225 Difference]: With dead ends: 258 [2020-08-27 21:50:37,201 INFO L226 Difference]: Without dead ends: 197 [2020-08-27 21:50:37,201 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-08-27 21:50:37,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-08-27 21:50:37,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2020-08-27 21:50:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-08-27 21:50:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2020-08-27 21:50:37,231 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2020-08-27 21:50:37,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:37,231 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2020-08-27 21:50:37,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-27 21:50:37,232 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2020-08-27 21:50:37,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-08-27 21:50:37,238 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:37,238 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] [2020-08-27 21:50:37,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-27 21:50:37,238 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:37,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:37,239 INFO L82 PathProgramCache]: Analyzing trace with hash 572107035, now seen corresponding path program 1 times [2020-08-27 21:50:37,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:37,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2116715123] [2020-08-27 21:50:37,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:37,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:37,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:37,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:37,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-27 21:50:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:37,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:37,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:50:37,564 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2116715123] [2020-08-27 21:50:37,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:50:37,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-27 21:50:37,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712977625] [2020-08-27 21:50:37,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-27 21:50:37,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:37,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-27 21:50:37,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:50:37,568 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand 10 states. [2020-08-27 21:50:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:38,550 INFO L93 Difference]: Finished difference Result 243 states and 316 transitions. [2020-08-27 21:50:38,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:50:38,552 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2020-08-27 21:50:38,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:38,554 INFO L225 Difference]: With dead ends: 243 [2020-08-27 21:50:38,555 INFO L226 Difference]: Without dead ends: 238 [2020-08-27 21:50:38,555 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-08-27 21:50:38,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-08-27 21:50:38,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 205. [2020-08-27 21:50:38,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-08-27 21:50:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 267 transitions. [2020-08-27 21:50:38,575 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 267 transitions. Word has length 50 [2020-08-27 21:50:38,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:38,576 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 267 transitions. [2020-08-27 21:50:38,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-27 21:50:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 267 transitions. [2020-08-27 21:50:38,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-27 21:50:38,577 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:38,578 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] [2020-08-27 21:50:38,578 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-27 21:50:38,578 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:38,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:38,579 INFO L82 PathProgramCache]: Analyzing trace with hash 176400751, now seen corresponding path program 1 times [2020-08-27 21:50:38,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:38,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1005539665] [2020-08-27 21:50:38,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:38,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:38,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:38,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:38,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-27 21:50:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:38,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:50:38,918 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1005539665] [2020-08-27 21:50:38,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:50:38,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-08-27 21:50:38,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52147756] [2020-08-27 21:50:38,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-27 21:50:38,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:38,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-27 21:50:38,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-08-27 21:50:38,920 INFO L87 Difference]: Start difference. First operand 205 states and 267 transitions. Second operand 14 states. [2020-08-27 21:50:40,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:40,360 INFO L93 Difference]: Finished difference Result 246 states and 313 transitions. [2020-08-27 21:50:40,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-27 21:50:40,360 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2020-08-27 21:50:40,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:40,362 INFO L225 Difference]: With dead ends: 246 [2020-08-27 21:50:40,362 INFO L226 Difference]: Without dead ends: 222 [2020-08-27 21:50:40,363 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2020-08-27 21:50:40,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-08-27 21:50:40,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 188. [2020-08-27 21:50:40,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-08-27 21:50:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2020-08-27 21:50:40,381 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 51 [2020-08-27 21:50:40,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:40,381 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2020-08-27 21:50:40,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-27 21:50:40,381 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2020-08-27 21:50:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-27 21:50:40,382 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:40,382 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] [2020-08-27 21:50:40,383 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-27 21:50:40,383 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:40,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:40,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1461171158, now seen corresponding path program 1 times [2020-08-27 21:50:40,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:40,384 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2132673678] [2020-08-27 21:50:40,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:40,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:40,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:40,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:40,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-27 21:50:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:40,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:50:40,622 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2132673678] [2020-08-27 21:50:40,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:50:40,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-27 21:50:40,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279432749] [2020-08-27 21:50:40,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-27 21:50:40,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:40,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-27 21:50:40,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:50:40,624 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand 8 states. [2020-08-27 21:50:40,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:40,874 INFO L93 Difference]: Finished difference Result 203 states and 262 transitions. [2020-08-27 21:50:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-27 21:50:40,874 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-08-27 21:50:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:40,875 INFO L225 Difference]: With dead ends: 203 [2020-08-27 21:50:40,876 INFO L226 Difference]: Without dead ends: 91 [2020-08-27 21:50:40,877 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:50:40,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-08-27 21:50:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-08-27 21:50:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-27 21:50:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2020-08-27 21:50:40,888 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 52 [2020-08-27 21:50:40,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:40,888 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2020-08-27 21:50:40,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-27 21:50:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2020-08-27 21:50:40,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-08-27 21:50:40,889 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:40,889 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:40,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-27 21:50:40,890 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:40,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:40,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1516710605, now seen corresponding path program 1 times [2020-08-27 21:50:40,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:40,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [557075573] [2020-08-27 21:50:40,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:41,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:41,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:41,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:41,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-27 21:50:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:41,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:41,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-27 21:50:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:41,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:50:41,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [557075573] [2020-08-27 21:50:41,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:50:41,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-27 21:50:41,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358121431] [2020-08-27 21:50:41,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-27 21:50:41,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:41,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-27 21:50:41,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-08-27 21:50:41,178 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 11 states. [2020-08-27 21:50:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:41,719 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2020-08-27 21:50:41,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-27 21:50:41,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2020-08-27 21:50:41,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:41,720 INFO L225 Difference]: With dead ends: 119 [2020-08-27 21:50:41,721 INFO L226 Difference]: Without dead ends: 91 [2020-08-27 21:50:41,722 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2020-08-27 21:50:41,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-08-27 21:50:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-08-27 21:50:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-27 21:50:41,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2020-08-27 21:50:41,732 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 59 [2020-08-27 21:50:41,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:41,733 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2020-08-27 21:50:41,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-27 21:50:41,733 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2020-08-27 21:50:41,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-27 21:50:41,734 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:41,734 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] [2020-08-27 21:50:41,734 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-27 21:50:41,734 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:41,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:41,735 INFO L82 PathProgramCache]: Analyzing trace with hash -14076392, now seen corresponding path program 1 times [2020-08-27 21:50:41,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:41,735 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [543359705] [2020-08-27 21:50:41,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:41,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:41,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:41,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:41,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-27 21:50:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:41,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:41,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-27 21:50:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:41,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:50:41,965 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [543359705] [2020-08-27 21:50:41,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:50:41,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-27 21:50:41,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608935964] [2020-08-27 21:50:41,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-27 21:50:41,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:41,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-27 21:50:41,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-27 21:50:41,968 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 9 states. [2020-08-27 21:50:42,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:42,188 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2020-08-27 21:50:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-27 21:50:42,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-08-27 21:50:42,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:42,191 INFO L225 Difference]: With dead ends: 122 [2020-08-27 21:50:42,193 INFO L226 Difference]: Without dead ends: 94 [2020-08-27 21:50:42,194 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-27 21:50:42,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-08-27 21:50:42,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-08-27 21:50:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-08-27 21:50:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2020-08-27 21:50:42,206 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 61 [2020-08-27 21:50:42,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:42,209 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2020-08-27 21:50:42,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-27 21:50:42,209 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2020-08-27 21:50:42,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-27 21:50:42,210 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:42,210 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] [2020-08-27 21:50:42,211 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-27 21:50:42,211 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:42,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:42,211 INFO L82 PathProgramCache]: Analyzing trace with hash -600882406, now seen corresponding path program 1 times [2020-08-27 21:50:42,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:42,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1569988672] [2020-08-27 21:50:42,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:42,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:42,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:42,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:42,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-27 21:50:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:42,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:42,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-27 21:50:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:42,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:50:42,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1569988672] [2020-08-27 21:50:42,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:50:42,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-27 21:50:42,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421221881] [2020-08-27 21:50:42,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-27 21:50:42,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:42,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-27 21:50:42,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:50:42,505 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 12 states. [2020-08-27 21:50:42,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:42,842 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2020-08-27 21:50:42,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:50:42,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2020-08-27 21:50:42,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:42,844 INFO L225 Difference]: With dead ends: 112 [2020-08-27 21:50:42,844 INFO L226 Difference]: Without dead ends: 93 [2020-08-27 21:50:42,844 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-08-27 21:50:42,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-27 21:50:42,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2020-08-27 21:50:42,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-08-27 21:50:42,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2020-08-27 21:50:42,855 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 61 [2020-08-27 21:50:42,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:42,856 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2020-08-27 21:50:42,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-27 21:50:42,856 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2020-08-27 21:50:42,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-08-27 21:50:42,857 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:42,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, 1, 1, 1, 1] [2020-08-27 21:50:42,857 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-27 21:50:42,858 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:42,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:42,858 INFO L82 PathProgramCache]: Analyzing trace with hash -673462309, now seen corresponding path program 1 times [2020-08-27 21:50:42,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:42,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1619362963] [2020-08-27 21:50:42,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:42,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:43,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:43,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:43,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-27 21:50:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:43,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:43,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-27 21:50:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:43,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:50:43,098 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1619362963] [2020-08-27 21:50:43,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:50:43,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-27 21:50:43,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640531434] [2020-08-27 21:50:43,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-27 21:50:43,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:43,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-27 21:50:43,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-27 21:50:43,100 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 9 states. [2020-08-27 21:50:43,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:43,325 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2020-08-27 21:50:43,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-27 21:50:43,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2020-08-27 21:50:43,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:43,327 INFO L225 Difference]: With dead ends: 105 [2020-08-27 21:50:43,327 INFO L226 Difference]: Without dead ends: 100 [2020-08-27 21:50:43,327 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:50:43,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-08-27 21:50:43,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2020-08-27 21:50:43,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-27 21:50:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2020-08-27 21:50:43,338 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 62 [2020-08-27 21:50:43,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:43,338 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2020-08-27 21:50:43,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-27 21:50:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2020-08-27 21:50:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-08-27 21:50:43,339 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:43,339 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-08-27 21:50:43,339 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-27 21:50:43,340 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:43,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:43,340 INFO L82 PathProgramCache]: Analyzing trace with hash 475938380, now seen corresponding path program 1 times [2020-08-27 21:50:43,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:43,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [641292271] [2020-08-27 21:50:43,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:43,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:43,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:43,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:43,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-27 21:50:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:43,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:43,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-27 21:50:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:43,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:50:43,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [641292271] [2020-08-27 21:50:43,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:50:43,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-27 21:50:43,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880085914] [2020-08-27 21:50:43,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-27 21:50:43,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:43,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-27 21:50:43,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:50:43,629 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 12 states. [2020-08-27 21:50:43,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:43,989 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2020-08-27 21:50:43,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:50:43,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2020-08-27 21:50:43,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:43,990 INFO L225 Difference]: With dead ends: 98 [2020-08-27 21:50:43,991 INFO L226 Difference]: Without dead ends: 91 [2020-08-27 21:50:43,991 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-08-27 21:50:43,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-08-27 21:50:44,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-08-27 21:50:44,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-27 21:50:44,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2020-08-27 21:50:44,002 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 62 [2020-08-27 21:50:44,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:44,003 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2020-08-27 21:50:44,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-27 21:50:44,003 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2020-08-27 21:50:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-27 21:50:44,004 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:44,005 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:44,005 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-27 21:50:44,005 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:44,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:44,006 INFO L82 PathProgramCache]: Analyzing trace with hash 359859562, now seen corresponding path program 1 times [2020-08-27 21:50:44,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:44,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1349693674] [2020-08-27 21:50:44,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:44,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:44,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:44,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:44,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-27 21:50:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:44,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:44,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-27 21:50:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:44,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:44,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:50:44,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1349693674] [2020-08-27 21:50:44,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:50:44,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-27 21:50:44,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512936122] [2020-08-27 21:50:44,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-27 21:50:44,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:44,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-27 21:50:44,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:50:44,299 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand 10 states. [2020-08-27 21:50:44,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:44,641 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2020-08-27 21:50:44,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:50:44,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-08-27 21:50:44,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:44,643 INFO L225 Difference]: With dead ends: 107 [2020-08-27 21:50:44,643 INFO L226 Difference]: Without dead ends: 76 [2020-08-27 21:50:44,644 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-08-27 21:50:44,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-08-27 21:50:44,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-08-27 21:50:44,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-08-27 21:50:44,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2020-08-27 21:50:44,653 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 63 [2020-08-27 21:50:44,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:44,654 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2020-08-27 21:50:44,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-27 21:50:44,654 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2020-08-27 21:50:44,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-27 21:50:44,655 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:44,655 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:44,655 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-27 21:50:44,655 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:44,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:44,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1228040100, now seen corresponding path program 1 times [2020-08-27 21:50:44,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:44,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1790035521] [2020-08-27 21:50:44,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:44,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:44,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:44,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:44,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-27 21:50:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:44,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:44,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-27 21:50:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:44,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:50:44,880 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1790035521] [2020-08-27 21:50:44,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:50:44,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-27 21:50:44,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026027708] [2020-08-27 21:50:44,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-27 21:50:44,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:44,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-27 21:50:44,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-27 21:50:44,882 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 9 states. [2020-08-27 21:50:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:45,213 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2020-08-27 21:50:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-27 21:50:45,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-08-27 21:50:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:45,215 INFO L225 Difference]: With dead ends: 141 [2020-08-27 21:50:45,215 INFO L226 Difference]: Without dead ends: 134 [2020-08-27 21:50:45,215 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-08-27 21:50:45,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-08-27 21:50:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2020-08-27 21:50:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-08-27 21:50:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2020-08-27 21:50:45,230 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2020-08-27 21:50:45,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:45,231 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2020-08-27 21:50:45,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-27 21:50:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2020-08-27 21:50:45,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-27 21:50:45,232 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:45,232 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:45,232 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-27 21:50:45,232 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:45,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:45,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1291919834, now seen corresponding path program 1 times [2020-08-27 21:50:45,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:45,233 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [655260374] [2020-08-27 21:50:45,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:45,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:45,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:45,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:45,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-27 21:50:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:45,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:45,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-27 21:50:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:45,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:50:45,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [655260374] [2020-08-27 21:50:45,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:50:45,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-27 21:50:45,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784423733] [2020-08-27 21:50:45,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-27 21:50:45,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:45,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-27 21:50:45,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:50:45,561 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 12 states. [2020-08-27 21:50:45,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:45,905 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2020-08-27 21:50:45,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:50:45,906 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2020-08-27 21:50:45,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:45,907 INFO L225 Difference]: With dead ends: 144 [2020-08-27 21:50:45,907 INFO L226 Difference]: Without dead ends: 133 [2020-08-27 21:50:45,908 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-08-27 21:50:45,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-08-27 21:50:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-08-27 21:50:45,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-08-27 21:50:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2020-08-27 21:50:45,922 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2020-08-27 21:50:45,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:45,922 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2020-08-27 21:50:45,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-27 21:50:45,922 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2020-08-27 21:50:45,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-08-27 21:50:45,923 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:45,924 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] [2020-08-27 21:50:45,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-08-27 21:50:45,924 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:45,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:45,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1154361885, now seen corresponding path program 1 times [2020-08-27 21:50:45,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:45,925 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [114496387] [2020-08-27 21:50:45,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:46,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:46,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-27 21:50:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:46,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:46,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-27 21:50:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:46,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:46,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-27 21:50:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:46,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-27 21:50:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:46,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-08-27 21:50:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:50:46,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [114496387] [2020-08-27 21:50:46,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:50:46,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-27 21:50:46,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121559867] [2020-08-27 21:50:46,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-27 21:50:46,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:46,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-27 21:50:46,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-08-27 21:50:46,208 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 11 states. [2020-08-27 21:50:46,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:46,446 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2020-08-27 21:50:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-27 21:50:46,447 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-08-27 21:50:46,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:46,447 INFO L225 Difference]: With dead ends: 133 [2020-08-27 21:50:46,447 INFO L226 Difference]: Without dead ends: 0 [2020-08-27 21:50:46,448 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-08-27 21:50:46,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-27 21:50:46,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-27 21:50:46,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-27 21:50:46,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-27 21:50:46,449 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2020-08-27 21:50:46,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:46,449 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-27 21:50:46,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-27 21:50:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-27 21:50:46,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-27 21:50:46,450 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-08-27 21:50:46,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-27 21:50:47,044 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2020-08-27 21:50:49,601 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-08-27 21:50:49,815 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2020-08-27 21:50:50,215 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-08-27 21:50:50,347 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 27 [2020-08-27 21:50:50,654 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 60 [2020-08-27 21:50:50,887 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2020-08-27 21:50:51,255 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2020-08-27 21:50:51,519 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-08-27 21:50:51,863 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2020-08-27 21:50:52,308 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2020-08-27 21:50:52,538 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2020-08-27 21:50:52,840 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2020-08-27 21:50:53,070 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2020-08-27 21:50:53,249 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-08-27 21:50:53,743 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2020-08-27 21:50:53,974 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2020-08-27 21:50:54,139 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-08-27 21:50:54,342 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2020-08-27 21:50:54,501 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2020-08-27 21:50:54,797 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-08-27 21:50:55,029 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-08-27 21:50:55,162 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-27 21:50:55,365 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-08-27 21:50:55,722 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2020-08-27 21:50:55,902 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2020-08-27 21:50:56,085 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2020-08-27 21:50:56,212 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-08-27 21:50:56,392 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-08-27 21:50:56,455 INFO L264 CegarLoopResult]: At program point KeSetEventENTRY(lines 513 520) the Hoare annotation is: (or (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~NP~0)) (not (= ~s~0 ~NP~0))) [2020-08-27 21:50:56,456 INFO L268 CegarLoopResult]: For program point KeSetEventFINAL(lines 513 520) no Hoare annotation was computed. [2020-08-27 21:50:56,456 INFO L268 CegarLoopResult]: For program point KeSetEventEXIT(lines 513 520) no Hoare annotation was computed. [2020-08-27 21:50:56,456 INFO L264 CegarLoopResult]: At program point KbFilter_CompleteENTRY(lines 563 573) the Hoare annotation is: (or (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~NP~0)) (not (= ~s~0 ~NP~0))) [2020-08-27 21:50:56,457 INFO L264 CegarLoopResult]: At program point L569(line 569) the Hoare annotation is: (or (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~NP~0)) (not (= ~s~0 ~NP~0))) [2020-08-27 21:50:56,457 INFO L268 CegarLoopResult]: For program point L569-1(line 569) no Hoare annotation was computed. [2020-08-27 21:50:56,457 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteFINAL(lines 563 573) no Hoare annotation was computed. [2020-08-27 21:50:56,457 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteEXIT(lines 563 573) no Hoare annotation was computed. [2020-08-27 21:50:56,457 INFO L268 CegarLoopResult]: For program point stub_driver_initEXIT(lines 35 48) no Hoare annotation was computed. [2020-08-27 21:50:56,457 INFO L264 CegarLoopResult]: At program point stub_driver_initENTRY(lines 35 48) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0)) (not (<= |old(~pended~0)| 0))) [2020-08-27 21:50:56,457 INFO L268 CegarLoopResult]: For program point stub_driver_initFINAL(lines 35 48) no Hoare annotation was computed. [2020-08-27 21:50:56,458 INFO L268 CegarLoopResult]: For program point _BLAST_initFINAL(lines 49 70) no Hoare annotation was computed. [2020-08-27 21:50:56,458 INFO L264 CegarLoopResult]: At program point _BLAST_initENTRY(lines 49 70) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~MPR3~0 |old(~MPR3~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~DC~0 |old(~DC~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-27 21:50:56,458 INFO L268 CegarLoopResult]: For program point _BLAST_initEXIT(lines 49 70) no Hoare annotation was computed. [2020-08-27 21:50:56,458 INFO L271 CegarLoopResult]: At program point errorFnENTRY(lines 575 582) the Hoare annotation is: true [2020-08-27 21:50:56,458 INFO L268 CegarLoopResult]: For program point errorFnFINAL(lines 575 582) no Hoare annotation was computed. [2020-08-27 21:50:56,458 INFO L268 CegarLoopResult]: For program point errorFnEXIT(lines 575 582) no Hoare annotation was computed. [2020-08-27 21:50:56,459 INFO L268 CegarLoopResult]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2020-08-27 21:50:56,459 INFO L264 CegarLoopResult]: At program point L382(lines 375 415) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-27 21:50:56,459 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 286 420) no Hoare annotation was computed. [2020-08-27 21:50:56,459 INFO L268 CegarLoopResult]: For program point L407(lines 407 409) no Hoare annotation was computed. [2020-08-27 21:50:56,459 INFO L264 CegarLoopResult]: At program point L374(lines 367 416) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-27 21:50:56,459 INFO L268 CegarLoopResult]: For program point L383(lines 367 416) no Hoare annotation was computed. [2020-08-27 21:50:56,460 INFO L268 CegarLoopResult]: For program point L350(lines 350 365) no Hoare annotation was computed. [2020-08-27 21:50:56,460 INFO L268 CegarLoopResult]: For program point L384(lines 384 413) no Hoare annotation was computed. [2020-08-27 21:50:56,460 INFO L264 CegarLoopResult]: At program point L351(lines 350 365) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (<= ~NP~0 1) (<= 0 main_~status~1) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 1 ~NP~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-27 21:50:56,460 INFO L268 CegarLoopResult]: For program point L376(lines 376 380) no Hoare annotation was computed. [2020-08-27 21:50:56,460 INFO L268 CegarLoopResult]: For program point L368(lines 368 372) no Hoare annotation was computed. [2020-08-27 21:50:56,460 INFO L268 CegarLoopResult]: For program point L335(lines 321 366) no Hoare annotation was computed. [2020-08-27 21:50:56,461 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 286 420) no Hoare annotation was computed. [2020-08-27 21:50:56,461 INFO L268 CegarLoopResult]: For program point L385(lines 385 412) no Hoare annotation was computed. [2020-08-27 21:50:56,461 INFO L264 CegarLoopResult]: At program point L319(line 319) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (= ~MPR3~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (<= ~IPC~0 ~s~0) (<= 0 main_~status~1) (= ~MPR1~0 ~NP~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-27 21:50:56,461 INFO L268 CegarLoopResult]: For program point L319-1(lines 295 419) no Hoare annotation was computed. [2020-08-27 21:50:56,461 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 286 420) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~Executive~0)| ~Executive~0) (= ~MPR3~0 |old(~MPR3~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~DC~0 |old(~DC~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-27 21:50:56,461 INFO L268 CegarLoopResult]: For program point L402(lines 402 410) no Hoare annotation was computed. [2020-08-27 21:50:56,462 INFO L264 CegarLoopResult]: At program point L394(lines 385 412) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-27 21:50:56,462 INFO L268 CegarLoopResult]: For program point L386(lines 386 392) no Hoare annotation was computed. [2020-08-27 21:50:56,462 INFO L264 CegarLoopResult]: At program point L353(lines 352 365) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (<= 0 main_~status~1) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-27 21:50:56,462 INFO L268 CegarLoopResult]: For program point L403(lines 403 405) no Hoare annotation was computed. [2020-08-27 21:50:56,462 INFO L268 CegarLoopResult]: For program point L387(lines 387 389) no Hoare annotation was computed. [2020-08-27 21:50:56,462 INFO L264 CegarLoopResult]: At program point L321(lines 295 419) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-27 21:50:56,463 INFO L268 CegarLoopResult]: For program point L338-1(lines 337 347) no Hoare annotation was computed. [2020-08-27 21:50:56,463 INFO L268 CegarLoopResult]: For program point L396(lines 396 400) no Hoare annotation was computed. [2020-08-27 21:50:56,463 INFO L268 CegarLoopResult]: For program point L330(lines 330 333) no Hoare annotation was computed. [2020-08-27 21:50:56,463 INFO L264 CegarLoopResult]: At program point L330-2(lines 330 333) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (<= ~NP~0 1) (<= 0 main_~status~1) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 1 ~NP~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-27 21:50:56,463 INFO L264 CegarLoopResult]: At program point L398(line 398) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-27 21:50:56,463 INFO L268 CegarLoopResult]: For program point L357(line 357) no Hoare annotation was computed. [2020-08-27 21:50:56,463 INFO L268 CegarLoopResult]: For program point L477(lines 477 494) no Hoare annotation was computed. [2020-08-27 21:50:56,464 INFO L264 CegarLoopResult]: At program point L444(line 444) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) (or .cse0 .cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-08-27 21:50:56,464 INFO L268 CegarLoopResult]: For program point L444-1(line 444) no Hoare annotation was computed. [2020-08-27 21:50:56,464 INFO L264 CegarLoopResult]: At program point L469(lines 442 497) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (let ((.cse2 (= ~MPR1~0 ~s~0))) (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (and .cse2 (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0)) (and (<= IofCallDriver_~returnVal2~0 0) .cse2) (not (<= 1 ~NP~0)))))) [2020-08-27 21:50:56,464 INFO L264 CegarLoopResult]: At program point L457(lines 456 471) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (and (= ~MPR1~0 ~s~0) (= ~setEventCalled~0 1)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-27 21:50:56,464 INFO L268 CegarLoopResult]: For program point L486(lines 486 493) no Hoare annotation was computed. [2020-08-27 21:50:56,465 INFO L268 CegarLoopResult]: For program point L449(lines 449 472) no Hoare annotation was computed. [2020-08-27 21:50:56,465 INFO L268 CegarLoopResult]: For program point L478(lines 478 484) no Hoare annotation was computed. [2020-08-27 21:50:56,465 INFO L264 CegarLoopResult]: At program point L445(line 445) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|))) (or .cse0 .cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-08-27 21:50:56,465 INFO L264 CegarLoopResult]: At program point IofCallDriverENTRY(lines 435 498) the Hoare annotation is: (let ((.cse2 (not (<= ~pended~0 0))) (.cse3 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse0 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse1 (= ~setEventCalled~0 |old(~setEventCalled~0)|))) (and (or (and .cse0 .cse1 (= ~s~0 ~NP~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse2 .cse3 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) (or .cse2 .cse3 (and .cse0 .cse1 (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-08-27 21:50:56,465 INFO L264 CegarLoopResult]: At program point L491(line 491) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-27 21:50:56,466 INFO L268 CegarLoopResult]: For program point L491-1(lines 473 495) no Hoare annotation was computed. [2020-08-27 21:50:56,466 INFO L268 CegarLoopResult]: For program point L454(lines 454 471) no Hoare annotation was computed. [2020-08-27 21:50:56,466 INFO L264 CegarLoopResult]: At program point L450(lines 449 472) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (= ~MPR1~0 ~s~0) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-27 21:50:56,466 INFO L268 CegarLoopResult]: For program point IofCallDriverFINAL(lines 435 498) no Hoare annotation was computed. [2020-08-27 21:50:56,466 INFO L268 CegarLoopResult]: For program point IofCallDriverEXIT(lines 435 498) no Hoare annotation was computed. [2020-08-27 21:50:56,467 INFO L264 CegarLoopResult]: At program point L455(lines 454 471) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (= ~MPR1~0 ~s~0) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-27 21:50:56,467 INFO L268 CegarLoopResult]: For program point L443(lines 443 446) no Hoare annotation was computed. [2020-08-27 21:50:56,467 INFO L268 CegarLoopResult]: For program point L443-1(lines 443 446) no Hoare annotation was computed. [2020-08-27 21:50:56,467 INFO L264 CegarLoopResult]: At program point L429(line 429) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= ~setEventCalled~0 1)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) [2020-08-27 21:50:56,467 INFO L268 CegarLoopResult]: For program point L429-1(lines 421 434) no Hoare annotation was computed. [2020-08-27 21:50:56,467 INFO L264 CegarLoopResult]: At program point stubMoreProcessingRequiredENTRY(lines 421 434) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~s~0 ~NP~0) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) [2020-08-27 21:50:56,467 INFO L268 CegarLoopResult]: For program point stubMoreProcessingRequiredEXIT(lines 421 434) no Hoare annotation was computed. [2020-08-27 21:50:56,468 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-08-27 21:50:56,468 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= ~NP~0 |old(~NP~0)|) (= ~MPR3~0 |old(~MPR3~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= ~s~0 |old(~s~0)|) (= ~SKIP1~0 |old(~SKIP1~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~DC~0 |old(~DC~0)|) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= ~Executive~0 |old(~Executive~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) [2020-08-27 21:50:56,468 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-08-27 21:50:56,468 INFO L264 CegarLoopResult]: At program point L541(line 541) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) .cse6))) [2020-08-27 21:50:56,468 INFO L268 CegarLoopResult]: For program point L539(lines 539 543) no Hoare annotation was computed. [2020-08-27 21:50:56,468 INFO L268 CegarLoopResult]: For program point L539-1(lines 526 545) no Hoare annotation was computed. [2020-08-27 21:50:56,468 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectEXIT(lines 521 562) no Hoare annotation was computed. [2020-08-27 21:50:56,469 INFO L268 CegarLoopResult]: For program point L527(lines 527 532) no Hoare annotation was computed. [2020-08-27 21:50:56,469 INFO L268 CegarLoopResult]: For program point L548(lines 548 560) no Hoare annotation was computed. [2020-08-27 21:50:56,469 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectFINAL(lines 521 562) no Hoare annotation was computed. [2020-08-27 21:50:56,469 INFO L264 CegarLoopResult]: At program point L534(lines 526 545) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0)) .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6))) [2020-08-27 21:50:56,469 INFO L268 CegarLoopResult]: For program point L526(lines 526 545) no Hoare annotation was computed. [2020-08-27 21:50:56,469 INFO L264 CegarLoopResult]: At program point L551(lines 550 560) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~s~0 ~NP~0) .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (= ~s~0 |old(~s~0)|) .cse6))) [2020-08-27 21:50:56,470 INFO L264 CegarLoopResult]: At program point KeWaitForSingleObjectENTRY(lines 521 562) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse8 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and (= ~MPR3~0 ~s~0) .cse6 .cse7) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse8) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (and .cse6 (= ~s~0 ~NP~0) .cse7) .cse8))) [2020-08-27 21:50:56,470 INFO L264 CegarLoopResult]: At program point L549(lines 548 560) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~s~0 ~NP~0) .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (= ~s~0 |old(~s~0)|) .cse6))) [2020-08-27 21:50:56,470 INFO L264 CegarLoopResult]: At program point L507(line 507) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0))) [2020-08-27 21:50:56,470 INFO L268 CegarLoopResult]: For program point L507-1(lines 499 512) no Hoare annotation was computed. [2020-08-27 21:50:56,470 INFO L264 CegarLoopResult]: At program point IofCompleteRequestENTRY(lines 499 512) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (= ~s~0 |old(~s~0)|)) [2020-08-27 21:50:56,471 INFO L268 CegarLoopResult]: For program point L503(lines 503 509) no Hoare annotation was computed. [2020-08-27 21:50:56,471 INFO L268 CegarLoopResult]: For program point IofCompleteRequestEXIT(lines 499 512) no Hoare annotation was computed. [2020-08-27 21:50:56,471 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-08-27 21:50:56,471 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~MPR3~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (<= ~IPC~0 ~s~0) (= ~MPR1~0 ~NP~0) (<= ~pended~0 0)) [2020-08-27 21:50:56,471 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-27 21:50:56,471 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-08-27 21:50:56,472 INFO L264 CegarLoopResult]: At program point L192(lines 192 194) the Hoare annotation is: (let ((.cse1 (<= 259 KbFilter_PnP_~status~0)) (.cse2 (= ~setEventCalled~0 1)) (.cse12 (<= 1 ~NP~0)) (.cse3 (<= 1 ~compRegistered~0)) (.cse13 (<= (+ ~NP~0 4) ~MPR1~0))) (let ((.cse0 (not (<= ~NP~0 1))) (.cse4 (not .cse13)) (.cse5 (not (<= ~pended~0 0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~NP~0 |old(~s~0)|))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse10 (and .cse1 .cse2 .cse13 (= ~s~0 |old(~s~0)|) .cse12 .cse3)) (.cse11 (not .cse12))) (and (or .cse0 (and (= ~MPR3~0 ~s~0) .cse1 .cse2 (= KbFilter_PnP_~__cil_tmp23~0 259) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse4 .cse5 .cse6 .cse8 .cse7 .cse9 .cse10 .cse11 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) (<= (+ ~myStatus~0 1073741637) 0))))) [2020-08-27 21:50:56,472 INFO L268 CegarLoopResult]: For program point L192-1(lines 192 194) no Hoare annotation was computed. [2020-08-27 21:50:56,472 INFO L268 CegarLoopResult]: For program point L151(lines 151 265) no Hoare annotation was computed. [2020-08-27 21:50:56,472 INFO L268 CegarLoopResult]: For program point L118(lines 118 276) no Hoare annotation was computed. [2020-08-27 21:50:56,472 INFO L264 CegarLoopResult]: At program point L209(line 209) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (<= 1 ~NP~0))) [2020-08-27 21:50:56,472 INFO L264 CegarLoopResult]: At program point L176(line 176) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-27 21:50:56,472 INFO L264 CegarLoopResult]: At program point L234(line 234) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-27 21:50:56,473 INFO L268 CegarLoopResult]: For program point L234-1(lines 230 236) no Hoare annotation was computed. [2020-08-27 21:50:56,473 INFO L268 CegarLoopResult]: For program point L160(lines 160 262) no Hoare annotation was computed. [2020-08-27 21:50:56,473 INFO L268 CegarLoopResult]: For program point L127(lines 127 273) no Hoare annotation was computed. [2020-08-27 21:50:56,473 INFO L264 CegarLoopResult]: At program point L218(line 218) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-27 21:50:56,473 INFO L264 CegarLoopResult]: At program point L185(lines 185 186) the Hoare annotation is: (let ((.cse0 (not (<= ~NP~0 1))) (.cse1 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse2 (not (<= ~pended~0 0))) (.cse3 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse4 (not (= |old(~compRegistered~0)| 0))) (.cse5 (not (= ~NP~0 |old(~s~0)|))) (.cse6 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse7 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ ~myStatus~0 1073741637) 0) (not (<= (+ |old(~myStatus~0)| 1073741637) 0))))) [2020-08-27 21:50:56,473 INFO L268 CegarLoopResult]: For program point L218-1(lines 214 220) no Hoare annotation was computed. [2020-08-27 21:50:56,474 INFO L268 CegarLoopResult]: For program point L185-1(lines 185 186) no Hoare annotation was computed. [2020-08-27 21:50:56,474 INFO L268 CegarLoopResult]: For program point L169(lines 169 181) no Hoare annotation was computed. [2020-08-27 21:50:56,474 INFO L268 CegarLoopResult]: For program point L136(lines 136 270) no Hoare annotation was computed. [2020-08-27 21:50:56,474 INFO L268 CegarLoopResult]: For program point L103(lines 103 281) no Hoare annotation was computed. [2020-08-27 21:50:56,474 INFO L271 CegarLoopResult]: At program point L260(lines 164 261) the Hoare annotation is: true [2020-08-27 21:50:56,474 INFO L268 CegarLoopResult]: For program point KbFilter_PnPEXIT(lines 73 285) no Hoare annotation was computed. [2020-08-27 21:50:56,474 INFO L268 CegarLoopResult]: For program point L145(lines 145 267) no Hoare annotation was computed. [2020-08-27 21:50:56,474 INFO L268 CegarLoopResult]: For program point L112(lines 112 278) no Hoare annotation was computed. [2020-08-27 21:50:56,475 INFO L264 CegarLoopResult]: At program point L104(lines 103 281) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-27 21:50:56,475 INFO L268 CegarLoopResult]: For program point L154(lines 154 264) no Hoare annotation was computed. [2020-08-27 21:50:56,475 INFO L268 CegarLoopResult]: For program point L121(lines 121 275) no Hoare annotation was computed. [2020-08-27 21:50:56,475 INFO L264 CegarLoopResult]: At program point KbFilter_PnPENTRY(lines 73 285) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-27 21:50:56,475 INFO L264 CegarLoopResult]: At program point L171(line 171) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-27 21:50:56,476 INFO L268 CegarLoopResult]: For program point KbFilter_PnPFINAL(lines 73 285) no Hoare annotation was computed. [2020-08-27 21:50:56,476 INFO L264 CegarLoopResult]: At program point L163(lines 109 279) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-27 21:50:56,476 INFO L268 CegarLoopResult]: For program point L130(lines 130 272) no Hoare annotation was computed. [2020-08-27 21:50:56,476 INFO L268 CegarLoopResult]: For program point L139(lines 139 269) no Hoare annotation was computed. [2020-08-27 21:50:56,476 INFO L268 CegarLoopResult]: For program point L106(lines 106 280) no Hoare annotation was computed. [2020-08-27 21:50:56,476 INFO L268 CegarLoopResult]: For program point L230(lines 230 236) no Hoare annotation was computed. [2020-08-27 21:50:56,476 INFO L264 CegarLoopResult]: At program point L255(lines 255 256) the Hoare annotation is: (or (not (<= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-27 21:50:56,477 INFO L268 CegarLoopResult]: For program point L255-1(lines 255 256) no Hoare annotation was computed. [2020-08-27 21:50:56,477 INFO L268 CegarLoopResult]: For program point L214(lines 214 220) no Hoare annotation was computed. [2020-08-27 21:50:56,477 INFO L268 CegarLoopResult]: For program point L148(lines 148 266) no Hoare annotation was computed. [2020-08-27 21:50:56,477 INFO L268 CegarLoopResult]: For program point L115(lines 115 277) no Hoare annotation was computed. [2020-08-27 21:50:56,477 INFO L264 CegarLoopResult]: At program point L107(lines 106 280) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-27 21:50:56,477 INFO L268 CegarLoopResult]: For program point L198(lines 198 204) no Hoare annotation was computed. [2020-08-27 21:50:56,477 INFO L268 CegarLoopResult]: For program point L190(lines 190 196) no Hoare annotation was computed. [2020-08-27 21:50:56,478 INFO L268 CegarLoopResult]: For program point L157(lines 157 263) no Hoare annotation was computed. [2020-08-27 21:50:56,478 INFO L268 CegarLoopResult]: For program point L124(lines 124 274) no Hoare annotation was computed. [2020-08-27 21:50:56,478 INFO L268 CegarLoopResult]: For program point L190-2(lines 164 259) no Hoare annotation was computed. [2020-08-27 21:50:56,478 INFO L264 CegarLoopResult]: At program point L240(line 240) the Hoare annotation is: (or (not (<= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-27 21:50:56,478 INFO L268 CegarLoopResult]: For program point L240-1(line 240) no Hoare annotation was computed. [2020-08-27 21:50:56,478 INFO L268 CegarLoopResult]: For program point L174(lines 174 180) no Hoare annotation was computed. [2020-08-27 21:50:56,478 INFO L268 CegarLoopResult]: For program point L174-1(lines 169 181) no Hoare annotation was computed. [2020-08-27 21:50:56,478 INFO L268 CegarLoopResult]: For program point L199(lines 199 203) no Hoare annotation was computed. [2020-08-27 21:50:56,479 INFO L268 CegarLoopResult]: For program point L133(lines 133 271) no Hoare annotation was computed. [2020-08-27 21:50:56,479 INFO L268 CegarLoopResult]: For program point L100(lines 100 282) no Hoare annotation was computed. [2020-08-27 21:50:56,479 INFO L264 CegarLoopResult]: At program point L224(lines 224 225) the Hoare annotation is: (or (not (<= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-27 21:50:56,479 INFO L268 CegarLoopResult]: For program point L224-1(lines 224 225) no Hoare annotation was computed. [2020-08-27 21:50:56,479 INFO L264 CegarLoopResult]: At program point L249(line 249) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-27 21:50:56,479 INFO L268 CegarLoopResult]: For program point L249-1(lines 245 251) no Hoare annotation was computed. [2020-08-27 21:50:56,479 INFO L268 CegarLoopResult]: For program point L142(lines 142 268) no Hoare annotation was computed. [2020-08-27 21:50:56,480 INFO L268 CegarLoopResult]: For program point L109(lines 109 279) no Hoare annotation was computed. [2020-08-27 21:50:56,480 INFO L264 CegarLoopResult]: At program point L101(lines 100 282) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-27 21:50:56,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 09:50:56 BoogieIcfgContainer [2020-08-27 21:50:56,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-27 21:50:56,526 INFO L168 Benchmark]: Toolchain (without parser) took 26950.36 ms. Allocated memory was 142.6 MB in the beginning and 453.0 MB in the end (delta: 310.4 MB). Free memory was 105.8 MB in the beginning and 201.7 MB in the end (delta: -96.0 MB). Peak memory consumption was 323.9 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:56,527 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 142.6 MB. Free memory was 124.1 MB in the beginning and 123.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-27 21:50:56,528 INFO L168 Benchmark]: CACSL2BoogieTranslator took 633.70 ms. Allocated memory was 142.6 MB in the beginning and 203.9 MB in the end (delta: 61.3 MB). Free memory was 105.6 MB in the beginning and 179.4 MB in the end (delta: -73.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:56,528 INFO L168 Benchmark]: Boogie Preprocessor took 58.73 ms. Allocated memory is still 203.9 MB. Free memory was 179.4 MB in the beginning and 176.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:56,529 INFO L168 Benchmark]: RCFGBuilder took 759.55 ms. Allocated memory is still 203.9 MB. Free memory was 176.8 MB in the beginning and 131.6 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:56,529 INFO L168 Benchmark]: TraceAbstraction took 25491.18 ms. Allocated memory was 203.9 MB in the beginning and 453.0 MB in the end (delta: 249.0 MB). Free memory was 131.0 MB in the beginning and 201.7 MB in the end (delta: -70.8 MB). Peak memory consumption was 287.8 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:56,532 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.28 ms. Allocated memory is still 142.6 MB. Free memory was 124.1 MB in the beginning and 123.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 633.70 ms. Allocated memory was 142.6 MB in the beginning and 203.9 MB in the end (delta: 61.3 MB). Free memory was 105.6 MB in the beginning and 179.4 MB in the end (delta: -73.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.73 ms. Allocated memory is still 203.9 MB. Free memory was 179.4 MB in the beginning and 176.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 759.55 ms. Allocated memory is still 203.9 MB. Free memory was 176.8 MB in the beginning and 131.6 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25491.18 ms. Allocated memory was 203.9 MB in the beginning and 453.0 MB in the end (delta: 249.0 MB). Free memory was 131.0 MB in the beginning and 201.7 MB in the end (delta: -70.8 MB). Peak memory consumption was 287.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 579]: 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: 367]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 <= status) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && ((((((((!(1 <= compRegistered) || MPR1 == s) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || ((setEventCalled == \old(setEventCalled) && s == NP) && \old(customIrp) == customIrp)) || !(1 <= NP)) && ((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP + 2 <= SKIP1)) || !(MPR3 == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && ((((((((!(1 <= compRegistered) || (MPR1 == s && setEventCalled == 1)) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 548]: Loop Invariant Derived loop invariant: (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(NP + 4 <= MPR1)) || s == NP) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP + 2 <= SKIP1)) || !(MPR3 == \old(s))) || !(1 <= NP)) && (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || s == \old(s)) || !(1 <= NP)) - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || (((MPR1 == s && setEventCalled == 1) && returnVal2 <= 259) && 259 <= returnVal2)) || (returnVal2 <= 0 && MPR1 == s)) || !(1 <= NP)) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(NP + 4 <= MPR1)) || s == NP) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP + 2 <= SKIP1)) || !(MPR3 == \old(s))) || !(1 <= NP)) && (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || s == \old(s)) || !(1 <= NP)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 454]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && ((((((((!(1 <= compRegistered) || MPR1 == s) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || ((((((((NP + 2 <= SKIP1 && compRegistered == 0) && s == NP) && NP <= 1) && 0 <= status) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && 1 <= NP) && pended <= 0)) || !(\old(s) == \old(MPR3))) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(s) == \old(MPR3))) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 151 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 15.3s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2162 SDtfs, 3407 SDslu, 2828 SDs, 0 SdLazy, 5133 SolverSat, 925 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 174 SyntacticMatches, 3 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred 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.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 186 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 53 LocationsWithAnnotation, 283 PreInvPairs, 349 NumberOfFragments, 3020 HoareAnnotationTreeSize, 283 FomulaSimplifications, 1712 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 53 FomulaSimplificationsInter, 7182 FormulaSimplificationTreeSizeReductionInter, 7.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 927 NumberOfCodeBlocks, 927 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 909 ConstructedInterpolants, 0 QuantifiedInterpolants, 205803 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...