/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 -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-86f66a4 [2020-07-07 11:14:25,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 11:14:25,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 11:14:25,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 11:14:25,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 11:14:25,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 11:14:25,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 11:14:25,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 11:14:25,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 11:14:25,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 11:14:25,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 11:14:25,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 11:14:25,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 11:14:25,973 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 11:14:25,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 11:14:25,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 11:14:25,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 11:14:25,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 11:14:25,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 11:14:25,980 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 11:14:25,982 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 11:14:25,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 11:14:25,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 11:14:25,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 11:14:25,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 11:14:25,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 11:14:25,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 11:14:25,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 11:14:25,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 11:14:25,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 11:14:25,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 11:14:25,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 11:14:25,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 11:14:25,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 11:14:25,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 11:14:25,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 11:14:25,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 11:14:25,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 11:14:25,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 11:14:25,995 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 11:14:25,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 11:14:25,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-07 11:14:26,017 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 11:14:26,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 11:14:26,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-07 11:14:26,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-07 11:14:26,020 INFO L138 SettingsManager]: * Use SBE=true [2020-07-07 11:14:26,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 11:14:26,020 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 11:14:26,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 11:14:26,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 11:14:26,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 11:14:26,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 11:14:26,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 11:14:26,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 11:14:26,022 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 11:14:26,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 11:14:26,023 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 11:14:26,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 11:14:26,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 11:14:26,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-07 11:14:26,023 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 11:14:26,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 11:14:26,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:14:26,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 11:14:26,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-07 11:14:26,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-07 11:14:26,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-07 11:14:26,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-07 11:14:26,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 11:14:26,025 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-07 11:14:26,026 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-07 11:14:26,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 11:14:26,328 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 11:14:26,331 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 11:14:26,332 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 11:14:26,332 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 11:14:26,333 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-07-07 11:14:26,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63b21af61/0bf3fe2437d249509cf7f67e19fd0bf1/FLAGacc38b08c [2020-07-07 11:14:26,927 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 11:14:26,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-07-07 11:14:26,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63b21af61/0bf3fe2437d249509cf7f67e19fd0bf1/FLAGacc38b08c [2020-07-07 11:14:27,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63b21af61/0bf3fe2437d249509cf7f67e19fd0bf1 [2020-07-07 11:14:27,293 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 11:14:27,295 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 11:14:27,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 11:14:27,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 11:14:27,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 11:14:27,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:14:27" (1/1) ... [2020-07-07 11:14:27,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1752101b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27, skipping insertion in model container [2020-07-07 11:14:27,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:14:27" (1/1) ... [2020-07-07 11:14:27,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 11:14:27,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 11:14:27,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:14:27,598 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 11:14:27,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:14:27,771 INFO L208 MainTranslator]: Completed translation [2020-07-07 11:14:27,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27 WrapperNode [2020-07-07 11:14:27,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 11:14:27,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 11:14:27,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 11:14:27,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 11:14:27,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27" (1/1) ... [2020-07-07 11:14:27,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27" (1/1) ... [2020-07-07 11:14:27,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27" (1/1) ... [2020-07-07 11:14:27,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27" (1/1) ... [2020-07-07 11:14:27,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27" (1/1) ... [2020-07-07 11:14:27,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27" (1/1) ... [2020-07-07 11:14:27,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27" (1/1) ... [2020-07-07 11:14:27,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 11:14:27,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 11:14:27,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 11:14:27,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 11:14:27,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:14:27,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 11:14:27,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 11:14:27,885 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-07-07 11:14:27,885 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-07-07 11:14:27,885 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2020-07-07 11:14:27,885 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 11:14:27,885 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-07-07 11:14:27,886 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-07-07 11:14:27,886 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-07-07 11:14:27,886 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-07-07 11:14:27,886 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-07-07 11:14:27,886 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2020-07-07 11:14:27,886 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-07-07 11:14:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 11:14:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-07 11:14:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 11:14:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-07-07 11:14:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2020-07-07 11:14:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-07-07 11:14:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-07-07 11:14:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-07-07 11:14:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2020-07-07 11:14:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-07-07 11:14:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-07-07 11:14:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-07-07 11:14:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-07-07 11:14:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 11:14:27,889 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-07-07 11:14:27,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 11:14:27,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 11:14:28,116 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-07 11:14:28,264 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2020-07-07 11:14:28,264 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2020-07-07 11:14:28,266 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-07 11:14:28,303 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2020-07-07 11:14:28,304 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2020-07-07 11:14:28,317 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-07 11:14:28,338 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-07-07 11:14:28,339 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-07-07 11:14:28,371 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-07 11:14:28,513 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2020-07-07 11:14:28,513 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2020-07-07 11:14:28,529 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 11:14:28,530 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-07 11:14:28,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:14:28 BoogieIcfgContainer [2020-07-07 11:14:28,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 11:14:28,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 11:14:28,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 11:14:28,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 11:14:28,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 11:14:27" (1/3) ... [2020-07-07 11:14:28,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec17559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:14:28, skipping insertion in model container [2020-07-07 11:14:28,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:14:27" (2/3) ... [2020-07-07 11:14:28,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec17559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:14:28, skipping insertion in model container [2020-07-07 11:14:28,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:14:28" (3/3) ... [2020-07-07 11:14:28,544 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2020-07-07 11:14:28,555 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-07 11:14:28,563 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 11:14:28,578 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 11:14:28,603 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 11:14:28,604 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 11:14:28,604 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-07 11:14:28,604 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 11:14:28,604 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 11:14:28,605 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 11:14:28,605 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 11:14:28,605 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 11:14:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2020-07-07 11:14:28,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-07 11:14:28,636 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:28,637 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:14:28,638 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:28,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:28,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1530382191, now seen corresponding path program 1 times [2020-07-07 11:14:28,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:28,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110139132] [2020-07-07 11:14:28,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:29,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:14:29,037 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110139132] [2020-07-07 11:14:29,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:29,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 11:14:29,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22261755] [2020-07-07 11:14:29,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 11:14:29,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:29,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 11:14:29,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 11:14:29,056 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2020-07-07 11:14:29,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:29,718 INFO L93 Difference]: Finished difference Result 303 states and 463 transitions. [2020-07-07 11:14:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-07 11:14:29,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-07 11:14:29,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:29,734 INFO L225 Difference]: With dead ends: 303 [2020-07-07 11:14:29,735 INFO L226 Difference]: Without dead ends: 157 [2020-07-07 11:14:29,741 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 11:14:29,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-07-07 11:14:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2020-07-07 11:14:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-07-07 11:14:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2020-07-07 11:14:29,808 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2020-07-07 11:14:29,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:29,808 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2020-07-07 11:14:29,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 11:14:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2020-07-07 11:14:29,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-07 11:14:29,810 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:29,810 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-07-07 11:14:29,810 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 11:14:29,811 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:29,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:29,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1141575010, now seen corresponding path program 1 times [2020-07-07 11:14:29,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:29,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080126878] [2020-07-07 11:14:29,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:14:30,122 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080126878] [2020-07-07 11:14:30,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:30,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-07 11:14:30,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850584282] [2020-07-07 11:14:30,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 11:14:30,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:30,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 11:14:30,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:14:30,126 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 6 states. [2020-07-07 11:14:30,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:30,826 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2020-07-07 11:14:30,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 11:14:30,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-07 11:14:30,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:30,830 INFO L225 Difference]: With dead ends: 275 [2020-07-07 11:14:30,830 INFO L226 Difference]: Without dead ends: 219 [2020-07-07 11:14:30,832 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-07-07 11:14:30,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-07-07 11:14:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2020-07-07 11:14:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-07-07 11:14:30,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2020-07-07 11:14:30,876 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2020-07-07 11:14:30,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:30,877 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2020-07-07 11:14:30,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 11:14:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2020-07-07 11:14:30,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-07 11:14:30,878 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:30,878 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-07-07 11:14:30,878 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 11:14:30,879 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:30,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:30,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1029098174, now seen corresponding path program 1 times [2020-07-07 11:14:30,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:30,880 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699062787] [2020-07-07 11:14:30,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:14:31,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699062787] [2020-07-07 11:14:31,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:31,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-07 11:14:31,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709685134] [2020-07-07 11:14:31,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 11:14:31,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:31,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 11:14:31,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:14:31,045 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand 6 states. [2020-07-07 11:14:31,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:31,378 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2020-07-07 11:14:31,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 11:14:31,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-07 11:14:31,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:31,382 INFO L225 Difference]: With dead ends: 316 [2020-07-07 11:14:31,382 INFO L226 Difference]: Without dead ends: 254 [2020-07-07 11:14:31,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-07 11:14:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-07-07 11:14:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2020-07-07 11:14:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-07-07 11:14:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2020-07-07 11:14:31,429 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2020-07-07 11:14:31,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:31,430 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2020-07-07 11:14:31,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 11:14:31,430 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2020-07-07 11:14:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-07 11:14:31,434 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:31,435 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-07-07 11:14:31,435 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 11:14:31,435 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:31,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:31,436 INFO L82 PathProgramCache]: Analyzing trace with hash 742933031, now seen corresponding path program 1 times [2020-07-07 11:14:31,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:31,436 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757709250] [2020-07-07 11:14:31,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:14:31,663 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757709250] [2020-07-07 11:14:31,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:31,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-07 11:14:31,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323580413] [2020-07-07 11:14:31,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 11:14:31,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:31,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 11:14:31,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:14:31,665 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand 6 states. [2020-07-07 11:14:32,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:32,182 INFO L93 Difference]: Finished difference Result 220 states and 291 transitions. [2020-07-07 11:14:32,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 11:14:32,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-07-07 11:14:32,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:32,191 INFO L225 Difference]: With dead ends: 220 [2020-07-07 11:14:32,192 INFO L226 Difference]: Without dead ends: 217 [2020-07-07 11:14:32,193 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-07 11:14:32,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-07-07 11:14:32,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2020-07-07 11:14:32,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-07-07 11:14:32,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2020-07-07 11:14:32,228 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2020-07-07 11:14:32,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:32,229 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2020-07-07 11:14:32,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 11:14:32,229 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2020-07-07 11:14:32,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-07 11:14:32,237 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:32,237 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:14:32,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 11:14:32,238 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:32,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:32,238 INFO L82 PathProgramCache]: Analyzing trace with hash 324263340, now seen corresponding path program 1 times [2020-07-07 11:14:32,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:32,239 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417137265] [2020-07-07 11:14:32,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:14:32,464 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417137265] [2020-07-07 11:14:32,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:32,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 11:14:32,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016759060] [2020-07-07 11:14:32,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 11:14:32,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:32,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 11:14:32,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-07 11:14:32,469 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand 8 states. [2020-07-07 11:14:33,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:33,123 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2020-07-07 11:14:33,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-07 11:14:33,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-07 11:14:33,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:33,127 INFO L225 Difference]: With dead ends: 274 [2020-07-07 11:14:33,128 INFO L226 Difference]: Without dead ends: 208 [2020-07-07 11:14:33,129 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-07-07 11:14:33,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-07-07 11:14:33,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2020-07-07 11:14:33,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-07-07 11:14:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2020-07-07 11:14:33,159 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2020-07-07 11:14:33,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:33,165 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2020-07-07 11:14:33,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 11:14:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2020-07-07 11:14:33,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-07 11:14:33,174 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:33,175 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-07-07 11:14:33,175 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 11:14:33,176 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:33,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:33,177 INFO L82 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 1 times [2020-07-07 11:14:33,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:33,177 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155321231] [2020-07-07 11:14:33,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:14:33,349 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155321231] [2020-07-07 11:14:33,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:33,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 11:14:33,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648431816] [2020-07-07 11:14:33,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 11:14:33,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:33,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 11:14:33,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-07 11:14:33,351 INFO L87 Difference]: Start difference. First operand 190 states and 250 transitions. Second operand 8 states. [2020-07-07 11:14:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:33,808 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2020-07-07 11:14:33,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 11:14:33,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-07-07 11:14:33,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:33,811 INFO L225 Difference]: With dead ends: 258 [2020-07-07 11:14:33,811 INFO L226 Difference]: Without dead ends: 197 [2020-07-07 11:14:33,812 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-07-07 11:14:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-07-07 11:14:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2020-07-07 11:14:33,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-07-07 11:14:33,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2020-07-07 11:14:33,827 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2020-07-07 11:14:33,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:33,827 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2020-07-07 11:14:33,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 11:14:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2020-07-07 11:14:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-07 11:14:33,829 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:33,829 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-07-07 11:14:33,829 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 11:14:33,829 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:33,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:33,830 INFO L82 PathProgramCache]: Analyzing trace with hash 572107035, now seen corresponding path program 1 times [2020-07-07 11:14:33,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:33,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202467681] [2020-07-07 11:14:33,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:34,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:14:34,078 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202467681] [2020-07-07 11:14:34,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:34,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:14:34,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912850289] [2020-07-07 11:14:34,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:14:34,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:34,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:14:34,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:14:34,081 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand 10 states. [2020-07-07 11:14:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:34,978 INFO L93 Difference]: Finished difference Result 243 states and 316 transitions. [2020-07-07 11:14:34,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-07 11:14:34,979 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2020-07-07 11:14:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:34,981 INFO L225 Difference]: With dead ends: 243 [2020-07-07 11:14:34,981 INFO L226 Difference]: Without dead ends: 238 [2020-07-07 11:14:34,982 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-07-07 11:14:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-07-07 11:14:34,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 205. [2020-07-07 11:14:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-07-07 11:14:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 267 transitions. [2020-07-07 11:14:34,999 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 267 transitions. Word has length 50 [2020-07-07 11:14:34,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:34,999 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 267 transitions. [2020-07-07 11:14:34,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:14:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 267 transitions. [2020-07-07 11:14:35,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-07 11:14:35,001 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:35,001 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-07-07 11:14:35,001 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 11:14:35,001 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:35,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:35,002 INFO L82 PathProgramCache]: Analyzing trace with hash 176400751, now seen corresponding path program 1 times [2020-07-07 11:14:35,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:35,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009276053] [2020-07-07 11:14:35,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:14:35,244 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009276053] [2020-07-07 11:14:35,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:35,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-07 11:14:35,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306086795] [2020-07-07 11:14:35,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-07 11:14:35,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:35,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-07 11:14:35,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:14:35,246 INFO L87 Difference]: Start difference. First operand 205 states and 267 transitions. Second operand 14 states. [2020-07-07 11:14:36,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:36,473 INFO L93 Difference]: Finished difference Result 246 states and 313 transitions. [2020-07-07 11:14:36,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-07 11:14:36,474 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2020-07-07 11:14:36,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:36,476 INFO L225 Difference]: With dead ends: 246 [2020-07-07 11:14:36,476 INFO L226 Difference]: Without dead ends: 222 [2020-07-07 11:14:36,477 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2020-07-07 11:14:36,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-07-07 11:14:36,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 188. [2020-07-07 11:14:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-07-07 11:14:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2020-07-07 11:14:36,494 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 51 [2020-07-07 11:14:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:36,494 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2020-07-07 11:14:36,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-07 11:14:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2020-07-07 11:14:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-07 11:14:36,496 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:36,496 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-07-07 11:14:36,496 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 11:14:36,496 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:36,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:36,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1461171158, now seen corresponding path program 1 times [2020-07-07 11:14:36,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:36,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656900204] [2020-07-07 11:14:36,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:36,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-07-07 11:14:36,665 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656900204] [2020-07-07 11:14:36,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:36,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 11:14:36,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213560178] [2020-07-07 11:14:36,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 11:14:36,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:36,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 11:14:36,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-07-07 11:14:36,669 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand 8 states. [2020-07-07 11:14:36,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:36,898 INFO L93 Difference]: Finished difference Result 203 states and 262 transitions. [2020-07-07 11:14:36,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 11:14:36,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-07-07 11:14:36,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:36,900 INFO L225 Difference]: With dead ends: 203 [2020-07-07 11:14:36,900 INFO L226 Difference]: Without dead ends: 91 [2020-07-07 11:14:36,900 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-07-07 11:14:36,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-07 11:14:36,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-07-07 11:14:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-07 11:14:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2020-07-07 11:14:36,911 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 52 [2020-07-07 11:14:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:36,911 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2020-07-07 11:14:36,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 11:14:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2020-07-07 11:14:36,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-07 11:14:36,912 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:36,912 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-07-07 11:14:36,912 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 11:14:36,913 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:36,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:36,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1516710605, now seen corresponding path program 1 times [2020-07-07 11:14:36,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:36,913 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980198331] [2020-07-07 11:14:36,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:14:37,132 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980198331] [2020-07-07 11:14:37,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:37,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-07 11:14:37,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002787153] [2020-07-07 11:14:37,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-07 11:14:37,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:37,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-07 11:14:37,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-07 11:14:37,134 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 12 states. [2020-07-07 11:14:37,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:37,580 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2020-07-07 11:14:37,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 11:14:37,580 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2020-07-07 11:14:37,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:37,581 INFO L225 Difference]: With dead ends: 119 [2020-07-07 11:14:37,581 INFO L226 Difference]: Without dead ends: 91 [2020-07-07 11:14:37,582 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-07-07 11:14:37,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-07 11:14:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-07-07 11:14:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-07 11:14:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2020-07-07 11:14:37,593 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 59 [2020-07-07 11:14:37,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:37,593 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2020-07-07 11:14:37,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-07 11:14:37,593 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2020-07-07 11:14:37,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-07 11:14:37,594 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:37,594 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-07-07 11:14:37,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 11:14:37,595 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:37,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:37,595 INFO L82 PathProgramCache]: Analyzing trace with hash -14076392, now seen corresponding path program 1 times [2020-07-07 11:14:37,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:37,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558555960] [2020-07-07 11:14:37,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:14:37,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558555960] [2020-07-07 11:14:37,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:37,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 11:14:37,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248723275] [2020-07-07 11:14:37,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 11:14:37,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:37,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 11:14:37,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:14:37,799 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 9 states. [2020-07-07 11:14:38,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:38,031 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2020-07-07 11:14:38,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 11:14:38,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-07-07 11:14:38,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:38,033 INFO L225 Difference]: With dead ends: 125 [2020-07-07 11:14:38,033 INFO L226 Difference]: Without dead ends: 97 [2020-07-07 11:14:38,034 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:14:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-07 11:14:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2020-07-07 11:14:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-07 11:14:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2020-07-07 11:14:38,044 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 61 [2020-07-07 11:14:38,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:38,045 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2020-07-07 11:14:38,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 11:14:38,045 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2020-07-07 11:14:38,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-07 11:14:38,046 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:38,046 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-07-07 11:14:38,046 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 11:14:38,046 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:38,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:38,047 INFO L82 PathProgramCache]: Analyzing trace with hash -600882406, now seen corresponding path program 1 times [2020-07-07 11:14:38,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:38,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44431592] [2020-07-07 11:14:38,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:38,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:14:38,265 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44431592] [2020-07-07 11:14:38,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:38,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-07 11:14:38,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032782295] [2020-07-07 11:14:38,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-07 11:14:38,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:38,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-07 11:14:38,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-07 11:14:38,267 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 12 states. [2020-07-07 11:14:38,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:38,541 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2020-07-07 11:14:38,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-07 11:14:38,542 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2020-07-07 11:14:38,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:38,543 INFO L225 Difference]: With dead ends: 112 [2020-07-07 11:14:38,544 INFO L226 Difference]: Without dead ends: 93 [2020-07-07 11:14:38,544 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-07-07 11:14:38,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-07 11:14:38,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2020-07-07 11:14:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-07-07 11:14:38,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2020-07-07 11:14:38,559 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 61 [2020-07-07 11:14:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:38,560 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2020-07-07 11:14:38,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-07 11:14:38,560 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2020-07-07 11:14:38,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-07 11:14:38,561 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:38,562 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:14:38,562 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-07 11:14:38,562 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:38,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:38,563 INFO L82 PathProgramCache]: Analyzing trace with hash -673462309, now seen corresponding path program 1 times [2020-07-07 11:14:38,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:38,563 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618001951] [2020-07-07 11:14:38,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:38,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:14:38,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618001951] [2020-07-07 11:14:38,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:38,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 11:14:38,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986056784] [2020-07-07 11:14:38,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 11:14:38,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:38,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 11:14:38,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:14:38,816 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 9 states. [2020-07-07 11:14:39,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:39,057 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2020-07-07 11:14:39,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-07 11:14:39,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2020-07-07 11:14:39,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:39,059 INFO L225 Difference]: With dead ends: 105 [2020-07-07 11:14:39,059 INFO L226 Difference]: Without dead ends: 100 [2020-07-07 11:14:39,060 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-07-07 11:14:39,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-07 11:14:39,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2020-07-07 11:14:39,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-07 11:14:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2020-07-07 11:14:39,073 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 62 [2020-07-07 11:14:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:39,073 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2020-07-07 11:14:39,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 11:14:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2020-07-07 11:14:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-07 11:14:39,078 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:39,078 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:14:39,078 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-07 11:14:39,078 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:39,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:39,079 INFO L82 PathProgramCache]: Analyzing trace with hash 475938380, now seen corresponding path program 1 times [2020-07-07 11:14:39,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:39,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307897122] [2020-07-07 11:14:39,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:39,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:14:39,344 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307897122] [2020-07-07 11:14:39,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:39,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-07 11:14:39,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037079568] [2020-07-07 11:14:39,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 11:14:39,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:39,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 11:14:39,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-07-07 11:14:39,346 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 13 states. [2020-07-07 11:14:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:39,588 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2020-07-07 11:14:39,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-07 11:14:39,589 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2020-07-07 11:14:39,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:39,590 INFO L225 Difference]: With dead ends: 99 [2020-07-07 11:14:39,590 INFO L226 Difference]: Without dead ends: 80 [2020-07-07 11:14:39,591 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:14:39,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-07 11:14:39,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-07-07 11:14:39,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-07 11:14:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2020-07-07 11:14:39,600 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 62 [2020-07-07 11:14:39,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:39,601 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2020-07-07 11:14:39,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 11:14:39,601 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2020-07-07 11:14:39,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-07 11:14:39,602 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:39,602 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-07-07 11:14:39,602 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-07 11:14:39,602 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:39,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:39,603 INFO L82 PathProgramCache]: Analyzing trace with hash 359859562, now seen corresponding path program 1 times [2020-07-07 11:14:39,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:39,603 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478015686] [2020-07-07 11:14:39,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:39,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-07-07 11:14:39,881 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478015686] [2020-07-07 11:14:39,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:39,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-07 11:14:39,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716127783] [2020-07-07 11:14:39,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-07 11:14:39,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:39,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-07 11:14:39,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-07-07 11:14:39,883 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 11 states. [2020-07-07 11:14:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:40,340 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2020-07-07 11:14:40,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-07 11:14:40,342 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2020-07-07 11:14:40,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:40,343 INFO L225 Difference]: With dead ends: 96 [2020-07-07 11:14:40,343 INFO L226 Difference]: Without dead ends: 76 [2020-07-07 11:14:40,344 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2020-07-07 11:14:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-07 11:14:40,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-07-07 11:14:40,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-07 11:14:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2020-07-07 11:14:40,369 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 63 [2020-07-07 11:14:40,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:40,369 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2020-07-07 11:14:40,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-07 11:14:40,370 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2020-07-07 11:14:40,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-07 11:14:40,371 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:40,371 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-07-07 11:14:40,371 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-07 11:14:40,371 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:40,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:40,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1228040100, now seen corresponding path program 1 times [2020-07-07 11:14:40,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:40,372 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568355728] [2020-07-07 11:14:40,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:14:40,635 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568355728] [2020-07-07 11:14:40,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:40,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 11:14:40,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057280346] [2020-07-07 11:14:40,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 11:14:40,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:40,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 11:14:40,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:14:40,638 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 9 states. [2020-07-07 11:14:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:40,905 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2020-07-07 11:14:40,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 11:14:40,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-07-07 11:14:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:40,907 INFO L225 Difference]: With dead ends: 141 [2020-07-07 11:14:40,907 INFO L226 Difference]: Without dead ends: 134 [2020-07-07 11:14:40,908 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-07-07 11:14:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-07-07 11:14:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2020-07-07 11:14:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-07-07 11:14:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2020-07-07 11:14:40,927 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2020-07-07 11:14:40,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:40,927 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2020-07-07 11:14:40,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 11:14:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2020-07-07 11:14:40,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-07 11:14:40,928 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:40,928 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-07-07 11:14:40,929 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-07 11:14:40,929 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:40,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:40,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1291919834, now seen corresponding path program 1 times [2020-07-07 11:14:40,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:40,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017480936] [2020-07-07 11:14:40,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:14:41,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017480936] [2020-07-07 11:14:41,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:41,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-07 11:14:41,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132190349] [2020-07-07 11:14:41,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-07 11:14:41,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:41,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-07 11:14:41,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-07 11:14:41,175 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 12 states. [2020-07-07 11:14:41,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:41,429 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2020-07-07 11:14:41,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-07 11:14:41,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2020-07-07 11:14:41,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:41,430 INFO L225 Difference]: With dead ends: 144 [2020-07-07 11:14:41,431 INFO L226 Difference]: Without dead ends: 133 [2020-07-07 11:14:41,431 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-07-07 11:14:41,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-07-07 11:14:41,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-07-07 11:14:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-07-07 11:14:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2020-07-07 11:14:41,449 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2020-07-07 11:14:41,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:41,449 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2020-07-07 11:14:41,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-07 11:14:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2020-07-07 11:14:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-07-07 11:14:41,450 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:14:41,451 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-07-07 11:14:41,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-07 11:14:41,451 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:14:41,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:14:41,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1154361885, now seen corresponding path program 1 times [2020-07-07 11:14:41,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:14:41,452 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463954363] [2020-07-07 11:14:41,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:14:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:14:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:14:41,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463954363] [2020-07-07 11:14:41,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:14:41,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-07 11:14:41,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658433382] [2020-07-07 11:14:41,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-07 11:14:41,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:14:41,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-07 11:14:41,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-07-07 11:14:41,725 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 12 states. [2020-07-07 11:14:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:14:41,981 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2020-07-07 11:14:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-07 11:14:41,982 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2020-07-07 11:14:41,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:14:41,982 INFO L225 Difference]: With dead ends: 133 [2020-07-07 11:14:41,983 INFO L226 Difference]: Without dead ends: 0 [2020-07-07 11:14:41,984 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:14:41,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-07 11:14:41,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-07 11:14:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-07 11:14:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-07 11:14:41,986 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2020-07-07 11:14:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:14:41,986 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-07 11:14:41,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-07 11:14:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-07 11:14:41,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-07 11:14:41,987 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-07 11:14:41,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-07 11:14:43,168 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2020-07-07 11:14:43,318 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2020-07-07 11:14:43,789 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2020-07-07 11:14:43,962 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2020-07-07 11:14:44,091 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 44 [2020-07-07 11:14:44,293 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 32 [2020-07-07 11:14:44,559 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 47 [2020-07-07 11:14:44,902 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 34 [2020-07-07 11:14:45,066 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2020-07-07 11:14:45,275 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2020-07-07 11:14:45,437 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2020-07-07 11:14:45,562 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 32 [2020-07-07 11:14:45,730 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2020-07-07 11:14:45,923 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-07-07 11:14:46,093 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 47 [2020-07-07 11:14:46,242 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2020-07-07 11:14:46,395 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2020-07-07 11:14:46,513 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2020-07-07 11:14:46,798 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2020-07-07 11:14:47,086 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2020-07-07 11:14:47,414 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 48 [2020-07-07 11:14:47,739 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 32 [2020-07-07 11:14:47,789 INFO L264 CegarLoopResult]: At program point KeSetEventENTRY(lines 513 520) the Hoare annotation is: (or (not (= ~s~0 ~NP~0)) (not (= 1 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= 1 ~pended~0) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~compRegistered~0))) [2020-07-07 11:14:47,790 INFO L268 CegarLoopResult]: For program point KeSetEventFINAL(lines 513 520) no Hoare annotation was computed. [2020-07-07 11:14:47,790 INFO L268 CegarLoopResult]: For program point KeSetEventEXIT(lines 513 520) no Hoare annotation was computed. [2020-07-07 11:14:47,790 INFO L264 CegarLoopResult]: At program point KbFilter_CompleteENTRY(lines 563 573) the Hoare annotation is: (or (not (= ~s~0 ~NP~0)) (not (= 1 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= 1 ~pended~0) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~compRegistered~0))) [2020-07-07 11:14:47,790 INFO L264 CegarLoopResult]: At program point L569(line 569) the Hoare annotation is: (or (not (= ~s~0 ~NP~0)) (not (= 1 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= 1 ~pended~0) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~compRegistered~0))) [2020-07-07 11:14:47,790 INFO L268 CegarLoopResult]: For program point L569-1(line 569) no Hoare annotation was computed. [2020-07-07 11:14:47,791 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteFINAL(lines 563 573) no Hoare annotation was computed. [2020-07-07 11:14:47,791 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteEXIT(lines 563 573) no Hoare annotation was computed. [2020-07-07 11:14:47,791 INFO L268 CegarLoopResult]: For program point stub_driver_initEXIT(lines 35 48) no Hoare annotation was computed. [2020-07-07 11:14:47,791 INFO L264 CegarLoopResult]: At program point stub_driver_initENTRY(lines 35 48) the Hoare annotation is: (or (and (= ~pended~0 |old(~pended~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= 1 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|))) [2020-07-07 11:14:47,791 INFO L268 CegarLoopResult]: For program point stub_driver_initFINAL(lines 35 48) no Hoare annotation was computed. [2020-07-07 11:14:47,792 INFO L268 CegarLoopResult]: For program point _BLAST_initFINAL(lines 49 70) no Hoare annotation was computed. [2020-07-07 11:14:47,792 INFO L264 CegarLoopResult]: At program point _BLAST_initENTRY(lines 49 70) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (and (= ~pended~0 |old(~pended~0)|) (= ~DC~0 |old(~DC~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~MPR1~0 ~s~0) (= ~compFptr~0 |old(~compFptr~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= ~MPR3~0 |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-07 11:14:47,792 INFO L268 CegarLoopResult]: For program point _BLAST_initEXIT(lines 49 70) no Hoare annotation was computed. [2020-07-07 11:14:47,792 INFO L271 CegarLoopResult]: At program point errorFnENTRY(lines 575 582) the Hoare annotation is: true [2020-07-07 11:14:47,792 INFO L268 CegarLoopResult]: For program point errorFnFINAL(lines 575 582) no Hoare annotation was computed. [2020-07-07 11:14:47,792 INFO L268 CegarLoopResult]: For program point errorFnEXIT(lines 575 582) no Hoare annotation was computed. [2020-07-07 11:14:47,793 INFO L268 CegarLoopResult]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2020-07-07 11:14:47,793 INFO L264 CegarLoopResult]: At program point L382(lines 375 415) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-07 11:14:47,793 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 286 420) no Hoare annotation was computed. [2020-07-07 11:14:47,793 INFO L268 CegarLoopResult]: For program point L407(lines 407 409) no Hoare annotation was computed. [2020-07-07 11:14:47,793 INFO L264 CegarLoopResult]: At program point L374(lines 367 416) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-07 11:14:47,793 INFO L268 CegarLoopResult]: For program point L383(lines 367 416) no Hoare annotation was computed. [2020-07-07 11:14:47,793 INFO L268 CegarLoopResult]: For program point L350(lines 350 365) no Hoare annotation was computed. [2020-07-07 11:14:47,794 INFO L268 CegarLoopResult]: For program point L384(lines 384 413) no Hoare annotation was computed. [2020-07-07 11:14:47,794 INFO L264 CegarLoopResult]: At program point L351(lines 350 365) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= 1 ~s~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-07 11:14:47,794 INFO L268 CegarLoopResult]: For program point L376(lines 376 380) no Hoare annotation was computed. [2020-07-07 11:14:47,794 INFO L268 CegarLoopResult]: For program point L368(lines 368 372) no Hoare annotation was computed. [2020-07-07 11:14:47,794 INFO L268 CegarLoopResult]: For program point L335(lines 321 366) no Hoare annotation was computed. [2020-07-07 11:14:47,794 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 286 420) no Hoare annotation was computed. [2020-07-07 11:14:47,794 INFO L268 CegarLoopResult]: For program point L385(lines 385 412) no Hoare annotation was computed. [2020-07-07 11:14:47,795 INFO L264 CegarLoopResult]: At program point L319(line 319) the Hoare annotation is: (or (and (= ~MPR1~0 ~s~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (<= ~IPC~0 ~s~0) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-07 11:14:47,795 INFO L268 CegarLoopResult]: For program point L319-1(lines 295 419) no Hoare annotation was computed. [2020-07-07 11:14:47,795 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 286 420) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (= ~pended~0 |old(~pended~0)|) (= ~DC~0 |old(~DC~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~MPR1~0 ~s~0) (= ~compFptr~0 |old(~compFptr~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= |old(~Executive~0)| ~Executive~0) (= ~MPR3~0 |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-07 11:14:47,795 INFO L268 CegarLoopResult]: For program point L402(lines 402 410) no Hoare annotation was computed. [2020-07-07 11:14:47,795 INFO L264 CegarLoopResult]: At program point L394(lines 385 412) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-07 11:14:47,795 INFO L268 CegarLoopResult]: For program point L386(lines 386 392) no Hoare annotation was computed. [2020-07-07 11:14:47,796 INFO L264 CegarLoopResult]: At program point L353(lines 352 365) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (<= 0 main_~status~1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-07 11:14:47,796 INFO L268 CegarLoopResult]: For program point L403(lines 403 405) no Hoare annotation was computed. [2020-07-07 11:14:47,796 INFO L268 CegarLoopResult]: For program point L387(lines 387 389) no Hoare annotation was computed. [2020-07-07 11:14:47,796 INFO L264 CegarLoopResult]: At program point L321(lines 295 419) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-07 11:14:47,796 INFO L268 CegarLoopResult]: For program point L338-1(lines 337 347) no Hoare annotation was computed. [2020-07-07 11:14:47,796 INFO L268 CegarLoopResult]: For program point L396(lines 396 400) no Hoare annotation was computed. [2020-07-07 11:14:47,796 INFO L268 CegarLoopResult]: For program point L330(lines 330 333) no Hoare annotation was computed. [2020-07-07 11:14:47,797 INFO L264 CegarLoopResult]: At program point L330-2(lines 330 333) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (<= 0 main_~status~1) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= 1 ~s~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-07 11:14:47,797 INFO L264 CegarLoopResult]: At program point L398(line 398) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~IPC~0)| |old(~s~0)|))) [2020-07-07 11:14:47,797 INFO L268 CegarLoopResult]: For program point L357(line 357) no Hoare annotation was computed. [2020-07-07 11:14:47,797 INFO L268 CegarLoopResult]: For program point L477(lines 477 494) no Hoare annotation was computed. [2020-07-07 11:14:47,797 INFO L264 CegarLoopResult]: At program point L444(line 444) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (= ~SKIP1~0 |old(~s~0)|)) .cse0 .cse1 (not (= 0 ~compRegistered~0)) .cse2) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= 1 ~s~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= 1 ~compRegistered~0))))) [2020-07-07 11:14:47,797 INFO L268 CegarLoopResult]: For program point L444-1(line 444) no Hoare annotation was computed. [2020-07-07 11:14:47,798 INFO L264 CegarLoopResult]: At program point L469(lines 442 497) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) .cse0 .cse1 (not (= 0 ~compRegistered~0)) .cse2) (let ((.cse3 (= ~MPR1~0 ~s~0))) (or (and .cse3 (= ~setEventCalled~0 1) (= 259 IofCallDriver_~returnVal2~0)) (and (<= IofCallDriver_~returnVal2~0 0) .cse3) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= 1 ~compRegistered~0)))))) [2020-07-07 11:14:47,798 INFO L264 CegarLoopResult]: At program point L457(lines 456 471) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 (and (= ~MPR1~0 ~s~0) (= ~setEventCalled~0 1)) (not (<= 1 ~compRegistered~0))) (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) .cse0 .cse1 (not (= 0 ~compRegistered~0)) .cse2))) [2020-07-07 11:14:47,798 INFO L268 CegarLoopResult]: For program point L486(lines 486 493) no Hoare annotation was computed. [2020-07-07 11:14:47,798 INFO L268 CegarLoopResult]: For program point L449(lines 449 472) no Hoare annotation was computed. [2020-07-07 11:14:47,798 INFO L268 CegarLoopResult]: For program point L478(lines 478 484) no Hoare annotation was computed. [2020-07-07 11:14:47,798 INFO L264 CegarLoopResult]: At program point L445(line 445) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (= ~SKIP1~0 |old(~s~0)|)) .cse0 .cse1 (not (= 0 ~compRegistered~0)) .cse2) (or .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) .cse1 (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 1) (= 1 ~s~0)) .cse2 (not (<= 1 ~compRegistered~0))))) [2020-07-07 11:14:47,799 INFO L264 CegarLoopResult]: At program point IofCallDriverENTRY(lines 435 498) the Hoare annotation is: (let ((.cse0 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse1 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse2 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse3 (= 1 ~pended~0)) (.cse4 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (= ~SKIP1~0 |old(~s~0)|)) (and .cse0 .cse1 (= ~SKIP1~0 ~s~0)) .cse2 .cse3 (not (= 0 ~compRegistered~0)) .cse4) (or (and .cse0 .cse1 (= 1 ~s~0)) .cse2 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) .cse3 (not (= ~NP~0 |old(~s~0)|)) .cse4 (not (<= 1 ~compRegistered~0))))) [2020-07-07 11:14:47,799 INFO L264 CegarLoopResult]: At program point L491(line 491) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (= ~SKIP1~0 |old(~s~0)|)) .cse0 .cse1 (not (= 0 ~compRegistered~0)) .cse2) (or .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= 1 ~compRegistered~0))))) [2020-07-07 11:14:47,799 INFO L268 CegarLoopResult]: For program point L491-1(lines 473 495) no Hoare annotation was computed. [2020-07-07 11:14:47,799 INFO L268 CegarLoopResult]: For program point L454(lines 454 471) no Hoare annotation was computed. [2020-07-07 11:14:47,799 INFO L264 CegarLoopResult]: At program point L450(lines 449 472) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) .cse0 .cse1 (not (= 0 ~compRegistered~0)) .cse2) (or (= ~MPR1~0 ~s~0) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= 1 ~compRegistered~0))))) [2020-07-07 11:14:47,799 INFO L268 CegarLoopResult]: For program point IofCallDriverFINAL(lines 435 498) no Hoare annotation was computed. [2020-07-07 11:14:47,799 INFO L268 CegarLoopResult]: For program point IofCallDriverEXIT(lines 435 498) no Hoare annotation was computed. [2020-07-07 11:14:47,800 INFO L264 CegarLoopResult]: At program point L455(lines 454 471) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0)) .cse0 .cse1 (not (= 0 ~compRegistered~0)) .cse2) (or (= ~MPR1~0 ~s~0) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= 1 ~compRegistered~0))))) [2020-07-07 11:14:47,800 INFO L268 CegarLoopResult]: For program point L443(lines 443 446) no Hoare annotation was computed. [2020-07-07 11:14:47,800 INFO L268 CegarLoopResult]: For program point L443-1(lines 443 446) no Hoare annotation was computed. [2020-07-07 11:14:47,800 INFO L264 CegarLoopResult]: At program point L429(line 429) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~setEventCalled~0 1)) (not (<= 1 ~compRegistered~0))) [2020-07-07 11:14:47,800 INFO L268 CegarLoopResult]: For program point L429-1(lines 421 434) no Hoare annotation was computed. [2020-07-07 11:14:47,800 INFO L264 CegarLoopResult]: At program point stubMoreProcessingRequiredENTRY(lines 421 434) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~setEventCalled~0 1)) (= 1 ~s~0) (not (<= 1 ~compRegistered~0))) [2020-07-07 11:14:47,800 INFO L268 CegarLoopResult]: For program point stubMoreProcessingRequiredEXIT(lines 421 434) no Hoare annotation was computed. [2020-07-07 11:14:47,800 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-07 11:14:47,801 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~pended~0 |old(~pended~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= ~NP~0 |old(~NP~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= ~Executive~0 |old(~Executive~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~s~0 |old(~s~0)|) (= ~DC~0 |old(~DC~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= ~SKIP1~0 |old(~SKIP1~0)|) (= ~MPR3~0 |old(~MPR3~0)|)) [2020-07-07 11:14:47,801 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-07 11:14:47,801 INFO L264 CegarLoopResult]: At program point L541(line 541) the Hoare annotation is: (or (not (= 1 |old(~setEventCalled~0)|)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (not (<= 1 ~compRegistered~0))) [2020-07-07 11:14:47,801 INFO L268 CegarLoopResult]: For program point L539(lines 539 543) no Hoare annotation was computed. [2020-07-07 11:14:47,801 INFO L268 CegarLoopResult]: For program point L539-1(lines 526 545) no Hoare annotation was computed. [2020-07-07 11:14:47,801 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectEXIT(lines 521 562) no Hoare annotation was computed. [2020-07-07 11:14:47,801 INFO L268 CegarLoopResult]: For program point L527(lines 527 532) no Hoare annotation was computed. [2020-07-07 11:14:47,802 INFO L268 CegarLoopResult]: For program point L548(lines 548 560) no Hoare annotation was computed. [2020-07-07 11:14:47,802 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectFINAL(lines 521 562) no Hoare annotation was computed. [2020-07-07 11:14:47,802 INFO L264 CegarLoopResult]: At program point L534(lines 526 545) the Hoare annotation is: (or (not (= 1 |old(~setEventCalled~0)|)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (not (<= 1 ~compRegistered~0))) [2020-07-07 11:14:47,802 INFO L268 CegarLoopResult]: For program point L526(lines 526 545) no Hoare annotation was computed. [2020-07-07 11:14:47,802 INFO L264 CegarLoopResult]: At program point L551(lines 550 560) the Hoare annotation is: (or (not (= 1 |old(~setEventCalled~0)|)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) (= ~s~0 ~NP~0) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (not (<= 1 ~compRegistered~0))) [2020-07-07 11:14:47,802 INFO L264 CegarLoopResult]: At program point KeWaitForSingleObjectENTRY(lines 521 562) the Hoare annotation is: (or (not (= 1 |old(~setEventCalled~0)|)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) (and (= ~MPR3~0 ~s~0) (= ~setEventCalled~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (not (<= 1 ~compRegistered~0))) [2020-07-07 11:14:47,803 INFO L264 CegarLoopResult]: At program point L549(lines 548 560) the Hoare annotation is: (or (not (= 1 |old(~setEventCalled~0)|)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) (= ~s~0 ~NP~0) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= 1 ~pended~0) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~NP~0 1)) (not (<= 1 ~compRegistered~0))) [2020-07-07 11:14:47,803 INFO L264 CegarLoopResult]: At program point L507(line 507) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~compRegistered~0))) [2020-07-07 11:14:47,803 INFO L268 CegarLoopResult]: For program point L507-1(lines 499 512) no Hoare annotation was computed. [2020-07-07 11:14:47,803 INFO L264 CegarLoopResult]: At program point IofCompleteRequestENTRY(lines 499 512) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (= ~s~0 |old(~s~0)|) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~compRegistered~0))) [2020-07-07 11:14:47,803 INFO L268 CegarLoopResult]: For program point L503(lines 503 509) no Hoare annotation was computed. [2020-07-07 11:14:47,803 INFO L268 CegarLoopResult]: For program point IofCompleteRequestEXIT(lines 499 512) no Hoare annotation was computed. [2020-07-07 11:14:47,803 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-07 11:14:47,804 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~MPR1~0 ~s~0) (not (= 1 ~pended~0)) (<= ~IPC~0 ~s~0) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) [2020-07-07 11:14:47,804 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-07 11:14:47,804 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-07 11:14:47,804 INFO L264 CegarLoopResult]: At program point L192(lines 192 194) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (= 1 ~pended~0)) (.cse2 (not (= 1 |old(~s~0)|))) (.cse4 (not (= ~NP~0 |old(~s~0)|))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (= 0 |old(~compRegistered~0)|)))) (and (or .cse0 .cse1 (and (<= KbFilter_PnP_~__cil_tmp23~0 259) (<= 259 KbFilter_PnP_~status~0) (= ~MPR3~0 ~s~0) (<= 259 KbFilter_PnP_~__cil_tmp23~0) (= ~setEventCalled~0 1) (<= 1 ~compRegistered~0)) .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) (<= (+ ~myStatus~0 1073741637) 0)))) [2020-07-07 11:14:47,804 INFO L268 CegarLoopResult]: For program point L192-1(lines 192 194) no Hoare annotation was computed. [2020-07-07 11:14:47,804 INFO L268 CegarLoopResult]: For program point L151(lines 151 265) no Hoare annotation was computed. [2020-07-07 11:14:47,805 INFO L268 CegarLoopResult]: For program point L118(lines 118 276) no Hoare annotation was computed. [2020-07-07 11:14:47,805 INFO L264 CegarLoopResult]: At program point L209(line 209) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= 0 |old(~compRegistered~0)|)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0))) [2020-07-07 11:14:47,805 INFO L264 CegarLoopResult]: At program point L176(line 176) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-07 11:14:47,805 INFO L264 CegarLoopResult]: At program point L234(line 234) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-07 11:14:47,805 INFO L268 CegarLoopResult]: For program point L234-1(lines 230 236) no Hoare annotation was computed. [2020-07-07 11:14:47,805 INFO L268 CegarLoopResult]: For program point L160(lines 160 262) no Hoare annotation was computed. [2020-07-07 11:14:47,805 INFO L268 CegarLoopResult]: For program point L127(lines 127 273) no Hoare annotation was computed. [2020-07-07 11:14:47,806 INFO L264 CegarLoopResult]: At program point L218(line 218) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-07 11:14:47,806 INFO L264 CegarLoopResult]: At program point L185(lines 185 186) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse1 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (= 1 ~pended~0)) (.cse2 (not (= 1 |old(~s~0)|))) (.cse4 (not (= ~NP~0 |old(~s~0)|))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (= 0 |old(~compRegistered~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (<= 1 ~compRegistered~0) (= 1 ~s~0)) .cse6) (or .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) (<= (+ ~myStatus~0 1073741637) 0)))) [2020-07-07 11:14:47,806 INFO L268 CegarLoopResult]: For program point L218-1(lines 214 220) no Hoare annotation was computed. [2020-07-07 11:14:47,806 INFO L268 CegarLoopResult]: For program point L185-1(lines 185 186) no Hoare annotation was computed. [2020-07-07 11:14:47,806 INFO L268 CegarLoopResult]: For program point L169(lines 169 181) no Hoare annotation was computed. [2020-07-07 11:14:47,806 INFO L268 CegarLoopResult]: For program point L136(lines 136 270) no Hoare annotation was computed. [2020-07-07 11:14:47,806 INFO L268 CegarLoopResult]: For program point L103(lines 103 281) no Hoare annotation was computed. [2020-07-07 11:14:47,806 INFO L271 CegarLoopResult]: At program point L260(lines 164 261) the Hoare annotation is: true [2020-07-07 11:14:47,807 INFO L268 CegarLoopResult]: For program point KbFilter_PnPEXIT(lines 73 285) no Hoare annotation was computed. [2020-07-07 11:14:47,807 INFO L268 CegarLoopResult]: For program point L145(lines 145 267) no Hoare annotation was computed. [2020-07-07 11:14:47,807 INFO L268 CegarLoopResult]: For program point L112(lines 112 278) no Hoare annotation was computed. [2020-07-07 11:14:47,807 INFO L264 CegarLoopResult]: At program point L104(lines 103 281) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-07 11:14:47,807 INFO L268 CegarLoopResult]: For program point L154(lines 154 264) no Hoare annotation was computed. [2020-07-07 11:14:47,807 INFO L268 CegarLoopResult]: For program point L121(lines 121 275) no Hoare annotation was computed. [2020-07-07 11:14:47,807 INFO L264 CegarLoopResult]: At program point KbFilter_PnPENTRY(lines 73 285) the Hoare annotation is: (or (and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= 1 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-07 11:14:47,808 INFO L264 CegarLoopResult]: At program point L171(line 171) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-07 11:14:47,808 INFO L268 CegarLoopResult]: For program point KbFilter_PnPFINAL(lines 73 285) no Hoare annotation was computed. [2020-07-07 11:14:47,808 INFO L264 CegarLoopResult]: At program point L163(lines 109 279) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-07 11:14:47,808 INFO L268 CegarLoopResult]: For program point L130(lines 130 272) no Hoare annotation was computed. [2020-07-07 11:14:47,808 INFO L268 CegarLoopResult]: For program point L139(lines 139 269) no Hoare annotation was computed. [2020-07-07 11:14:47,808 INFO L268 CegarLoopResult]: For program point L106(lines 106 280) no Hoare annotation was computed. [2020-07-07 11:14:47,808 INFO L268 CegarLoopResult]: For program point L230(lines 230 236) no Hoare annotation was computed. [2020-07-07 11:14:47,808 INFO L264 CegarLoopResult]: At program point L255(lines 255 256) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= 0 |old(~compRegistered~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0))) [2020-07-07 11:14:47,809 INFO L268 CegarLoopResult]: For program point L255-1(lines 255 256) no Hoare annotation was computed. [2020-07-07 11:14:47,809 INFO L268 CegarLoopResult]: For program point L214(lines 214 220) no Hoare annotation was computed. [2020-07-07 11:14:47,809 INFO L268 CegarLoopResult]: For program point L148(lines 148 266) no Hoare annotation was computed. [2020-07-07 11:14:47,809 INFO L268 CegarLoopResult]: For program point L115(lines 115 277) no Hoare annotation was computed. [2020-07-07 11:14:47,809 INFO L264 CegarLoopResult]: At program point L107(lines 106 280) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~s~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-07 11:14:47,809 INFO L268 CegarLoopResult]: For program point L198(lines 198 204) no Hoare annotation was computed. [2020-07-07 11:14:47,809 INFO L268 CegarLoopResult]: For program point L190(lines 190 196) no Hoare annotation was computed. [2020-07-07 11:14:47,809 INFO L268 CegarLoopResult]: For program point L157(lines 157 263) no Hoare annotation was computed. [2020-07-07 11:14:47,810 INFO L268 CegarLoopResult]: For program point L124(lines 124 274) no Hoare annotation was computed. [2020-07-07 11:14:47,810 INFO L268 CegarLoopResult]: For program point L190-2(lines 164 259) no Hoare annotation was computed. [2020-07-07 11:14:47,810 INFO L264 CegarLoopResult]: At program point L240(line 240) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= 0 |old(~compRegistered~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0))) [2020-07-07 11:14:47,810 INFO L268 CegarLoopResult]: For program point L240-1(line 240) no Hoare annotation was computed. [2020-07-07 11:14:47,810 INFO L268 CegarLoopResult]: For program point L174(lines 174 180) no Hoare annotation was computed. [2020-07-07 11:14:47,810 INFO L268 CegarLoopResult]: For program point L174-1(lines 169 181) no Hoare annotation was computed. [2020-07-07 11:14:47,810 INFO L268 CegarLoopResult]: For program point L199(lines 199 203) no Hoare annotation was computed. [2020-07-07 11:14:47,810 INFO L268 CegarLoopResult]: For program point L133(lines 133 271) no Hoare annotation was computed. [2020-07-07 11:14:47,810 INFO L268 CegarLoopResult]: For program point L100(lines 100 282) no Hoare annotation was computed. [2020-07-07 11:14:47,811 INFO L264 CegarLoopResult]: At program point L224(lines 224 225) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= 0 |old(~compRegistered~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0))) [2020-07-07 11:14:47,811 INFO L268 CegarLoopResult]: For program point L224-1(lines 224 225) no Hoare annotation was computed. [2020-07-07 11:14:47,811 INFO L264 CegarLoopResult]: At program point L249(line 249) the Hoare annotation is: (or (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-07 11:14:47,811 INFO L268 CegarLoopResult]: For program point L249-1(lines 245 251) no Hoare annotation was computed. [2020-07-07 11:14:47,811 INFO L268 CegarLoopResult]: For program point L142(lines 142 268) no Hoare annotation was computed. [2020-07-07 11:14:47,811 INFO L268 CegarLoopResult]: For program point L109(lines 109 279) no Hoare annotation was computed. [2020-07-07 11:14:47,811 INFO L264 CegarLoopResult]: At program point L101(lines 100 282) the Hoare annotation is: (or (and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= 1 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 1 |old(~s~0)|)) (= 1 ~pended~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= 0 |old(~compRegistered~0)|))) [2020-07-07 11:14:47,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 11:14:47 BoogieIcfgContainer [2020-07-07 11:14:47,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 11:14:47,847 INFO L168 Benchmark]: Toolchain (without parser) took 20552.47 ms. Allocated memory was 145.2 MB in the beginning and 489.7 MB in the end (delta: 344.5 MB). Free memory was 102.9 MB in the beginning and 356.1 MB in the end (delta: -253.2 MB). Peak memory consumption was 337.8 MB. Max. memory is 7.1 GB. [2020-07-07 11:14:47,847 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-07 11:14:47,848 INFO L168 Benchmark]: CACSL2BoogieTranslator took 476.26 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 102.7 MB in the beginning and 177.2 MB in the end (delta: -74.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2020-07-07 11:14:47,848 INFO L168 Benchmark]: Boogie Preprocessor took 47.09 ms. Allocated memory is still 202.4 MB. Free memory was 177.2 MB in the beginning and 175.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-07-07 11:14:47,849 INFO L168 Benchmark]: RCFGBuilder took 716.01 ms. Allocated memory is still 202.4 MB. Free memory was 175.1 MB in the beginning and 129.4 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. [2020-07-07 11:14:47,849 INFO L168 Benchmark]: TraceAbstraction took 19308.07 ms. Allocated memory was 202.4 MB in the beginning and 489.7 MB in the end (delta: 287.3 MB). Free memory was 129.4 MB in the beginning and 356.1 MB in the end (delta: -226.8 MB). Peak memory consumption was 307.1 MB. Max. memory is 7.1 GB. [2020-07-07 11:14:47,852 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.23 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 476.26 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 102.7 MB in the beginning and 177.2 MB in the end (delta: -74.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.09 ms. Allocated memory is still 202.4 MB. Free memory was 177.2 MB in the beginning and 175.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 716.01 ms. Allocated memory is still 202.4 MB. Free memory was 175.1 MB in the beginning and 129.4 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19308.07 ms. Allocated memory was 202.4 MB in the beginning and 489.7 MB in the end (delta: 287.3 MB). Free memory was 129.4 MB in the beginning and 356.1 MB in the end (delta: -226.8 MB). Peak memory consumption was 307.1 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: ((((((((!(1 == pended) && SKIP2 + 3 <= IPC) && NP + 2 <= SKIP1) || !(\old(NP) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || !(\old(IPC) <= \old(s)) - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) && SKIP2 + 3 <= IPC) && NP + 2 <= SKIP1) || !(\old(NP) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || !(\old(IPC) <= \old(s)) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((!(\old(NP) == \old(MPR1)) || 0 <= status) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || !(\old(IPC) <= \old(s)) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((!(NP + 2 <= SKIP1) || !(NP + 4 <= MPR1)) || !(1 == \old(s))) || 1 == pended) || !(NP == \old(s))) || !(SKIP2 + 3 <= IPC)) || (((((\old(compRegistered) == compRegistered && s == NP) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && lowerDriverReturn == \old(lowerDriverReturn))) || !(0 == \old(compRegistered)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((!(NP + 2 <= SKIP1) || !(NP + 4 <= MPR1)) || !(1 == \old(s))) || 1 == pended) || !(NP == \old(s))) || !(SKIP2 + 3 <= IPC)) || (((((\old(compRegistered) == compRegistered && s == NP) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && lowerDriverReturn == \old(lowerDriverReturn))) || !(0 == \old(compRegistered)) - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: (((((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || 1 == pended) || !(0 == compRegistered)) || !(SKIP2 + 3 <= IPC)) && (((((((MPR1 == s || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(1 == \old(s))) || 1 == pended) || !(NP == \old(s))) || !(SKIP2 + 3 <= IPC)) || !(1 <= compRegistered)) - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((((((!(1 == \old(setEventCalled)) || !(MPR3 == \old(s))) || !(1 <= NP)) || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(SKIP2 + 3 <= IPC)) || !(NP <= 1)) || !(1 <= compRegistered) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((((((((((\old(compRegistered) == compRegistered && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && lowerDriverReturn == \old(lowerDriverReturn)) && 1 == s) || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(1 == \old(s))) || 1 == pended) || !(NP == \old(s))) || !(SKIP2 + 3 <= IPC)) || !(0 == \old(compRegistered)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: (((((((!(NP + 2 <= SKIP1) || !(NP + 4 <= MPR1)) || !(1 == \old(s))) || 1 == pended) || !(NP == \old(s))) || !(SKIP2 + 3 <= IPC)) || (MPR1 == s && setEventCalled == 1)) || !(1 <= compRegistered)) && (((((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || 1 == pended) || !(0 == compRegistered)) || !(SKIP2 + 3 <= IPC)) - InvariantResult [Line: 548]: Loop Invariant Derived loop invariant: ((((((((!(1 == \old(setEventCalled)) || !(MPR3 == \old(s))) || !(1 <= NP)) || s == NP) || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(SKIP2 + 3 <= IPC)) || !(NP <= 1)) || !(1 <= compRegistered) - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: (((((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || 1 == pended) || !(0 == compRegistered)) || !(SKIP2 + 3 <= IPC)) && ((((((((((MPR1 == s && setEventCalled == 1) && 259 == returnVal2) || (returnVal2 <= 0 && MPR1 == s)) || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(1 == \old(s))) || 1 == pended) || !(NP == \old(s))) || !(SKIP2 + 3 <= IPC)) || !(1 <= compRegistered)) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: ((((((((!(1 == \old(setEventCalled)) || !(MPR3 == \old(s))) || !(1 <= NP)) || s == NP) || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || 1 == pended) || !(SKIP2 + 3 <= IPC)) || !(NP <= 1)) || !(1 <= compRegistered) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) && SKIP2 + 3 <= IPC) && NP + 2 <= SKIP1) || !(\old(NP) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || !(\old(IPC) <= \old(s)) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((!(NP + 2 <= SKIP1) || !(NP + 4 <= MPR1)) || !(1 == \old(s))) || 1 == pended) || !(NP == \old(s))) || !(SKIP2 + 3 <= IPC)) || (((((\old(compRegistered) == compRegistered && s == NP) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && lowerDriverReturn == \old(lowerDriverReturn))) || !(0 == \old(compRegistered)) - InvariantResult [Line: 454]: Loop Invariant Derived loop invariant: (((((!(SKIP1 == \old(s)) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || 1 == pended) || !(0 == compRegistered)) || !(SKIP2 + 3 <= IPC)) && (((((((MPR1 == s || !(NP + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(1 == \old(s))) || 1 == pended) || !(NP == \old(s))) || !(SKIP2 + 3 <= IPC)) || !(1 <= compRegistered)) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((((((((((((s == NP && 0 <= status) && !(1 == pended)) && 0 == compRegistered) && NP + 4 <= MPR1) && SKIP2 + 3 <= IPC) && NP + 2 <= SKIP1) && 1 == s) || !(\old(NP) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || !(\old(IPC) <= \old(s)) - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) && SKIP2 + 3 <= IPC) && NP + 2 <= SKIP1) || !(\old(NP) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || 1 == \old(pended)) || !(0 == \old(compRegistered))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || !(\old(IPC) <= \old(s)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 151 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.3s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2161 SDtfs, 3457 SDslu, 2907 SDs, 0 SdLazy, 5252 SolverSat, 955 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 168 SyntacticMatches, 4 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 4.0s 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, 189 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 53 LocationsWithAnnotation, 284 PreInvPairs, 348 NumberOfFragments, 2548 HoareAnnotationTreeSize, 284 FomulaSimplifications, 2301 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 53 FomulaSimplificationsInter, 6933 FormulaSimplificationTreeSizeReductionInter, 4.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 927 NumberOfCodeBlocks, 927 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 909 ConstructedInterpolants, 0 QuantifiedInterpolants, 206178 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...