./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7833fe68-aed8-44ea-a573-0962e3ae48e3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7833fe68-aed8-44ea-a573-0962e3ae48e3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7833fe68-aed8-44ea-a573-0962e3ae48e3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7833fe68-aed8-44ea-a573-0962e3ae48e3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7833fe68-aed8-44ea-a573-0962e3ae48e3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7833fe68-aed8-44ea-a573-0962e3ae48e3/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 411af8a324a718637cdc1e76e82ebb1de5e49e9c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 15:14:11,505 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:14:11,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:14:11,514 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:14:11,514 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:14:11,515 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:14:11,516 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:14:11,517 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:14:11,519 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:14:11,519 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:14:11,520 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:14:11,520 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:14:11,521 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:14:11,522 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:14:11,523 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:14:11,524 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:14:11,524 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:14:11,526 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:14:11,527 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:14:11,528 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:14:11,529 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:14:11,530 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:14:11,532 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:14:11,532 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:14:11,532 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:14:11,533 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:14:11,533 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:14:11,534 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:14:11,534 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:14:11,535 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:14:11,535 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:14:11,535 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:14:11,535 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:14:11,536 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:14:11,536 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:14:11,537 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:14:11,537 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7833fe68-aed8-44ea-a573-0962e3ae48e3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 15:14:11,548 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:14:11,548 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:14:11,549 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 15:14:11,549 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 15:14:11,549 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 15:14:11,549 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 15:14:11,549 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 15:14:11,550 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 15:14:11,550 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 15:14:11,550 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 15:14:11,550 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 15:14:11,550 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 15:14:11,550 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 15:14:11,551 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:14:11,551 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:14:11,551 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:14:11,551 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:14:11,551 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:14:11,552 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 15:14:11,552 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 15:14:11,552 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 15:14:11,552 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:14:11,552 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:14:11,552 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:14:11,552 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 15:14:11,552 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:14:11,553 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:14:11,553 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 15:14:11,553 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 15:14:11,553 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:14:11,553 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:14:11,553 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 15:14:11,553 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 15:14:11,554 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 15:14:11,554 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 15:14:11,554 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 15:14:11,554 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 15:14:11,554 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_7833fe68-aed8-44ea-a573-0962e3ae48e3/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 411af8a324a718637cdc1e76e82ebb1de5e49e9c [2018-11-18 15:14:11,580 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:14:11,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:14:11,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:14:11,594 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:14:11,594 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:14:11,595 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7833fe68-aed8-44ea-a573-0962e3ae48e3/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 15:14:11,644 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7833fe68-aed8-44ea-a573-0962e3ae48e3/bin-2019/utaipan/data/53c3740ce/6efcbf06eea3458ebfafa855ee6bb205/FLAG9b28f8977 [2018-11-18 15:14:12,030 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:14:12,031 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7833fe68-aed8-44ea-a573-0962e3ae48e3/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 15:14:12,042 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7833fe68-aed8-44ea-a573-0962e3ae48e3/bin-2019/utaipan/data/53c3740ce/6efcbf06eea3458ebfafa855ee6bb205/FLAG9b28f8977 [2018-11-18 15:14:12,420 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7833fe68-aed8-44ea-a573-0962e3ae48e3/bin-2019/utaipan/data/53c3740ce/6efcbf06eea3458ebfafa855ee6bb205 [2018-11-18 15:14:12,422 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:14:12,423 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:14:12,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:14:12,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:14:12,426 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:14:12,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:14:12" (1/1) ... [2018-11-18 15:14:12,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@258af236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:14:12, skipping insertion in model container [2018-11-18 15:14:12,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:14:12" (1/1) ... [2018-11-18 15:14:12,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:14:12,475 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:14:12,655 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:14:12,659 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:14:12,707 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:14:12,720 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:14:12,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:14:12 WrapperNode [2018-11-18 15:14:12,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:14:12,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:14:12,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:14:12,721 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:14:12,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:14:12" (1/1) ... [2018-11-18 15:14:12,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:14:12" (1/1) ... [2018-11-18 15:14:12,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:14:12,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:14:12,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:14:12,790 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:14:12,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:14:12" (1/1) ... [2018-11-18 15:14:12,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:14:12" (1/1) ... [2018-11-18 15:14:12,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:14:12" (1/1) ... [2018-11-18 15:14:12,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:14:12" (1/1) ... [2018-11-18 15:14:12,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:14:12" (1/1) ... [2018-11-18 15:14:12,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:14:12" (1/1) ... [2018-11-18 15:14:12,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:14:12" (1/1) ... [2018-11-18 15:14:12,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:14:12,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:14:12,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:14:12,823 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:14:12,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:14:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7833fe68-aed8-44ea-a573-0962e3ae48e3/bin-2019/utaipan/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 [2018-11-18 15:14:12,859 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-18 15:14:12,859 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-18 15:14:12,859 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2018-11-18 15:14:12,859 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2018-11-18 15:14:12,859 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2018-11-18 15:14:12,859 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2018-11-18 15:14:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-18 15:14:12,860 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-18 15:14:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-18 15:14:12,860 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-18 15:14:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-18 15:14:12,860 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-18 15:14:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 15:14:12,861 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 15:14:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-18 15:14:12,861 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-18 15:14:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-18 15:14:12,861 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-18 15:14:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-18 15:14:12,861 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-18 15:14:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2018-11-18 15:14:12,862 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2018-11-18 15:14:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 15:14:12,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 15:14:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2018-11-18 15:14:12,862 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2018-11-18 15:14:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-18 15:14:12,862 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-18 15:14:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-18 15:14:12,862 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-18 15:14:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:14:12,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:14:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2018-11-18 15:14:12,862 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2018-11-18 15:14:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2018-11-18 15:14:12,863 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2018-11-18 15:14:13,009 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:14:13,009 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:14:13,074 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:14:13,075 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:14:13,203 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:14:13,203 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:14:13,247 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:14:13,248 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:14:13,328 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:14:13,328 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:14:13,363 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:14:13,364 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:14:13,444 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:14:13,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:14:13 BoogieIcfgContainer [2018-11-18 15:14:13,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:14:13,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 15:14:13,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 15:14:13,448 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 15:14:13,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:14:12" (1/3) ... [2018-11-18 15:14:13,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acc1248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:14:13, skipping insertion in model container [2018-11-18 15:14:13,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:14:12" (2/3) ... [2018-11-18 15:14:13,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acc1248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:14:13, skipping insertion in model container [2018-11-18 15:14:13,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:14:13" (3/3) ... [2018-11-18 15:14:13,451 INFO L112 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 15:14:13,457 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 15:14:13,463 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 15:14:13,474 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 15:14:13,497 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 15:14:13,497 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 15:14:13,497 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 15:14:13,498 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:14:13,498 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:14:13,498 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 15:14:13,498 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:14:13,498 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 15:14:13,517 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states. [2018-11-18 15:14:13,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 15:14:13,522 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:13,523 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:14:13,525 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:13,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:13,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1712773315, now seen corresponding path program 1 times [2018-11-18 15:14:13,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:14:13,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:13,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:14:13,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:13,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:14:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:14:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:14:13,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:14:13,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:14:13,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:14:13,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:14:13,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:14:13,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:14:13,705 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 3 states. [2018-11-18 15:14:13,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:13,814 INFO L93 Difference]: Finished difference Result 388 states and 582 transitions. [2018-11-18 15:14:13,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:14:13,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 15:14:13,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:13,827 INFO L225 Difference]: With dead ends: 388 [2018-11-18 15:14:13,828 INFO L226 Difference]: Without dead ends: 228 [2018-11-18 15:14:13,831 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:14:13,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-11-18 15:14:13,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-11-18 15:14:13,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-11-18 15:14:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2018-11-18 15:14:13,876 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 20 [2018-11-18 15:14:13,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:13,877 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2018-11-18 15:14:13,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:14:13,877 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2018-11-18 15:14:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 15:14:13,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:13,878 INFO L375 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] [2018-11-18 15:14:13,878 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:13,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:13,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1840561730, now seen corresponding path program 1 times [2018-11-18 15:14:13,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:14:13,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:13,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:14:13,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:13,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:14:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:14:13,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:14:13,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:14:13,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:14:13,990 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:14:13,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:14:13,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:14:13,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:14:13,992 INFO L87 Difference]: Start difference. First operand 228 states and 322 transitions. Second operand 3 states. [2018-11-18 15:14:14,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:14,109 INFO L93 Difference]: Finished difference Result 366 states and 502 transitions. [2018-11-18 15:14:14,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:14:14,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 15:14:14,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:14,111 INFO L225 Difference]: With dead ends: 366 [2018-11-18 15:14:14,111 INFO L226 Difference]: Without dead ends: 308 [2018-11-18 15:14:14,112 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:14:14,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-18 15:14:14,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 295. [2018-11-18 15:14:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-11-18 15:14:14,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 404 transitions. [2018-11-18 15:14:14,135 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 404 transitions. Word has length 28 [2018-11-18 15:14:14,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:14,135 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 404 transitions. [2018-11-18 15:14:14,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:14:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 404 transitions. [2018-11-18 15:14:14,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 15:14:14,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:14,137 INFO L375 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] [2018-11-18 15:14:14,137 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:14,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:14,137 INFO L82 PathProgramCache]: Analyzing trace with hash -919522484, now seen corresponding path program 1 times [2018-11-18 15:14:14,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:14:14,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:14,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:14:14,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:14,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:14:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:14:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:14:14,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:14:14,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:14:14,190 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:14:14,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:14:14,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:14:14,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:14:14,191 INFO L87 Difference]: Start difference. First operand 295 states and 404 transitions. Second operand 3 states. [2018-11-18 15:14:14,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:14,246 INFO L93 Difference]: Finished difference Result 472 states and 628 transitions. [2018-11-18 15:14:14,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:14:14,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 15:14:14,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:14,249 INFO L225 Difference]: With dead ends: 472 [2018-11-18 15:14:14,249 INFO L226 Difference]: Without dead ends: 356 [2018-11-18 15:14:14,250 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:14:14,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-18 15:14:14,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 335. [2018-11-18 15:14:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-11-18 15:14:14,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 455 transitions. [2018-11-18 15:14:14,273 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 455 transitions. Word has length 28 [2018-11-18 15:14:14,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:14,274 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 455 transitions. [2018-11-18 15:14:14,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:14:14,274 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 455 transitions. [2018-11-18 15:14:14,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 15:14:14,276 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:14,276 INFO L375 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] [2018-11-18 15:14:14,276 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:14,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:14,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1823384951, now seen corresponding path program 1 times [2018-11-18 15:14:14,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:14:14,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:14,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:14:14,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:14,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:14:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:14:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:14:14,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:14:14,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:14:14,330 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:14:14,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:14:14,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:14:14,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:14:14,331 INFO L87 Difference]: Start difference. First operand 335 states and 455 transitions. Second operand 3 states. [2018-11-18 15:14:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:14,406 INFO L93 Difference]: Finished difference Result 338 states and 457 transitions. [2018-11-18 15:14:14,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:14:14,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-18 15:14:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:14,408 INFO L225 Difference]: With dead ends: 338 [2018-11-18 15:14:14,408 INFO L226 Difference]: Without dead ends: 334 [2018-11-18 15:14:14,409 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:14:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-11-18 15:14:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2018-11-18 15:14:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-11-18 15:14:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 452 transitions. [2018-11-18 15:14:14,424 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 452 transitions. Word has length 38 [2018-11-18 15:14:14,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:14,425 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 452 transitions. [2018-11-18 15:14:14,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:14:14,425 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 452 transitions. [2018-11-18 15:14:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 15:14:14,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:14,427 INFO L375 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] [2018-11-18 15:14:14,427 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:14,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:14,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1946925920, now seen corresponding path program 1 times [2018-11-18 15:14:14,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:14:14,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:14,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:14:14,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:14,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:14:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:14:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:14:14,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:14:14,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:14:14,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:14:14,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 15:14:14,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:14:14,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:14:14,485 INFO L87 Difference]: Start difference. First operand 334 states and 452 transitions. Second operand 4 states. [2018-11-18 15:14:14,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:14,581 INFO L93 Difference]: Finished difference Result 379 states and 501 transitions. [2018-11-18 15:14:14,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:14:14,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-18 15:14:14,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:14,583 INFO L225 Difference]: With dead ends: 379 [2018-11-18 15:14:14,583 INFO L226 Difference]: Without dead ends: 313 [2018-11-18 15:14:14,583 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:14:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-18 15:14:14,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 295. [2018-11-18 15:14:14,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-11-18 15:14:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 395 transitions. [2018-11-18 15:14:14,595 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 395 transitions. Word has length 46 [2018-11-18 15:14:14,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:14,596 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 395 transitions. [2018-11-18 15:14:14,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 15:14:14,596 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 395 transitions. [2018-11-18 15:14:14,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 15:14:14,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:14,598 INFO L375 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] [2018-11-18 15:14:14,598 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:14,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:14,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1615603168, now seen corresponding path program 1 times [2018-11-18 15:14:14,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:14:14,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:14,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:14:14,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:14,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:14:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:14:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:14:14,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:14:14,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:14:14,642 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:14:14,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:14:14,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:14:14,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:14:14,643 INFO L87 Difference]: Start difference. First operand 295 states and 395 transitions. Second operand 3 states. [2018-11-18 15:14:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:14,677 INFO L93 Difference]: Finished difference Result 304 states and 406 transitions. [2018-11-18 15:14:14,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:14:14,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-18 15:14:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:14,678 INFO L225 Difference]: With dead ends: 304 [2018-11-18 15:14:14,678 INFO L226 Difference]: Without dead ends: 102 [2018-11-18 15:14:14,679 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:14:14,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-18 15:14:14,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-18 15:14:14,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-18 15:14:14,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2018-11-18 15:14:14,685 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 45 [2018-11-18 15:14:14,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:14,685 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2018-11-18 15:14:14,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:14:14,685 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2018-11-18 15:14:14,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 15:14:14,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:14,686 INFO L375 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] [2018-11-18 15:14:14,686 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:14,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:14,687 INFO L82 PathProgramCache]: Analyzing trace with hash -582629432, now seen corresponding path program 1 times [2018-11-18 15:14:14,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:14:14,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:14,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:14:14,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:14,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:14:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:14:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:14:14,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:14:14,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:14:14,748 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:14:14,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:14:14,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:14:14,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:14:14,749 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand 3 states. [2018-11-18 15:14:14,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:14,773 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2018-11-18 15:14:14,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:14:14,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-11-18 15:14:14,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:14,774 INFO L225 Difference]: With dead ends: 130 [2018-11-18 15:14:14,774 INFO L226 Difference]: Without dead ends: 100 [2018-11-18 15:14:14,775 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:14:14,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-18 15:14:14,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-18 15:14:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-18 15:14:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2018-11-18 15:14:14,780 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2018-11-18 15:14:14,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:14,781 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2018-11-18 15:14:14,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:14:14,781 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2018-11-18 15:14:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 15:14:14,782 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:14,782 INFO L375 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] [2018-11-18 15:14:14,782 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:14,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:14,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1306380805, now seen corresponding path program 1 times [2018-11-18 15:14:14,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:14:14,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:14,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:14:14,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:14,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:14:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:14:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:14:14,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:14:14,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:14:14,836 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:14:14,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:14:14,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:14:14,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:14:14,837 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 6 states. [2018-11-18 15:14:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:14,862 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2018-11-18 15:14:14,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:14:14,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-11-18 15:14:14,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:14,863 INFO L225 Difference]: With dead ends: 152 [2018-11-18 15:14:14,863 INFO L226 Difference]: Without dead ends: 111 [2018-11-18 15:14:14,864 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:14:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-18 15:14:14,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2018-11-18 15:14:14,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-18 15:14:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2018-11-18 15:14:14,868 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 57 [2018-11-18 15:14:14,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:14,869 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2018-11-18 15:14:14,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:14:14,869 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2018-11-18 15:14:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 15:14:14,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:14,870 INFO L375 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] [2018-11-18 15:14:14,870 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:14,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:14,870 INFO L82 PathProgramCache]: Analyzing trace with hash -538994442, now seen corresponding path program 1 times [2018-11-18 15:14:14,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:14:14,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:14,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:14:14,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:14,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:14:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:14:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:14:14,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:14:14,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:14:14,918 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:14:14,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:14:14,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:14:14,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:14:14,919 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 6 states. [2018-11-18 15:14:14,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:14,948 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2018-11-18 15:14:14,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:14:14,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-11-18 15:14:14,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:14,950 INFO L225 Difference]: With dead ends: 116 [2018-11-18 15:14:14,950 INFO L226 Difference]: Without dead ends: 109 [2018-11-18 15:14:14,950 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:14:14,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-18 15:14:14,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-11-18 15:14:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-18 15:14:14,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-11-18 15:14:14,955 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 57 [2018-11-18 15:14:14,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:14,956 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-11-18 15:14:14,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:14:14,956 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-11-18 15:14:14,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 15:14:14,956 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:14,957 INFO L375 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] [2018-11-18 15:14:14,957 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:14,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:14,957 INFO L82 PathProgramCache]: Analyzing trace with hash -914264427, now seen corresponding path program 1 times [2018-11-18 15:14:14,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:14:14,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:14,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:14:14,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:14,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:14:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:14:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:14:14,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:14:14,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:14:14,993 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:14:14,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:14:14,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:14:14,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:14:14,994 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 3 states. [2018-11-18 15:14:15,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:15,021 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2018-11-18 15:14:15,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:14:15,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-11-18 15:14:15,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:15,023 INFO L225 Difference]: With dead ends: 122 [2018-11-18 15:14:15,023 INFO L226 Difference]: Without dead ends: 117 [2018-11-18 15:14:15,023 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:14:15,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-18 15:14:15,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2018-11-18 15:14:15,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-18 15:14:15,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2018-11-18 15:14:15,028 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 58 [2018-11-18 15:14:15,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:15,028 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2018-11-18 15:14:15,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:14:15,028 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2018-11-18 15:14:15,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 15:14:15,029 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:15,029 INFO L375 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] [2018-11-18 15:14:15,029 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:15,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:15,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1535327622, now seen corresponding path program 1 times [2018-11-18 15:14:15,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:14:15,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:15,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:14:15,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:15,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:14:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:14:15,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:14:15,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:14:15,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:14:15,090 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:14:15,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:14:15,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:14:15,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:14:15,091 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 5 states. [2018-11-18 15:14:15,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:15,099 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2018-11-18 15:14:15,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:14:15,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-11-18 15:14:15,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:15,101 INFO L225 Difference]: With dead ends: 146 [2018-11-18 15:14:15,101 INFO L226 Difference]: Without dead ends: 102 [2018-11-18 15:14:15,101 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:14:15,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-18 15:14:15,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-18 15:14:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-18 15:14:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-11-18 15:14:15,107 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 58 [2018-11-18 15:14:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:15,107 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-11-18 15:14:15,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:14:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-11-18 15:14:15,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 15:14:15,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:15,108 INFO L375 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] [2018-11-18 15:14:15,108 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:15,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:15,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1832020397, now seen corresponding path program 1 times [2018-11-18 15:14:15,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:14:15,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:15,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:14:15,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:15,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:14:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:14:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:14:15,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:14:15,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:14:15,158 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:14:15,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:14:15,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:14:15,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:14:15,158 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 5 states. [2018-11-18 15:14:15,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:15,232 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2018-11-18 15:14:15,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:14:15,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-11-18 15:14:15,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:15,233 INFO L225 Difference]: With dead ends: 132 [2018-11-18 15:14:15,233 INFO L226 Difference]: Without dead ends: 94 [2018-11-18 15:14:15,234 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:14:15,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-18 15:14:15,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-11-18 15:14:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 15:14:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2018-11-18 15:14:15,238 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 62 [2018-11-18 15:14:15,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:15,239 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2018-11-18 15:14:15,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:14:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2018-11-18 15:14:15,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 15:14:15,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:15,239 INFO L375 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] [2018-11-18 15:14:15,240 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:15,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:15,240 INFO L82 PathProgramCache]: Analyzing trace with hash 198062706, now seen corresponding path program 1 times [2018-11-18 15:14:15,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:14:15,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:15,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:14:15,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:15,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:14:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:14:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:14:15,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:14:15,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:14:15,264 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:14:15,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:14:15,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:14:15,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:14:15,264 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 3 states. [2018-11-18 15:14:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:15,283 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2018-11-18 15:14:15,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:14:15,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-11-18 15:14:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:15,284 INFO L225 Difference]: With dead ends: 130 [2018-11-18 15:14:15,284 INFO L226 Difference]: Without dead ends: 100 [2018-11-18 15:14:15,284 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:14:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-18 15:14:15,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-11-18 15:14:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-18 15:14:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-11-18 15:14:15,289 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 64 [2018-11-18 15:14:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:15,289 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-11-18 15:14:15,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:14:15,289 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-11-18 15:14:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 15:14:15,290 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:15,290 INFO L375 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] [2018-11-18 15:14:15,290 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:15,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:15,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1883613746, now seen corresponding path program 1 times [2018-11-18 15:14:15,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:14:15,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:15,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:14:15,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:15,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:14:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:14:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:14:15,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:14:15,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 15:14:15,340 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:14:15,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 15:14:15,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:14:15,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:14:15,341 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 7 states. [2018-11-18 15:14:15,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:15,367 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-11-18 15:14:15,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:14:15,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-11-18 15:14:15,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:15,369 INFO L225 Difference]: With dead ends: 116 [2018-11-18 15:14:15,369 INFO L226 Difference]: Without dead ends: 97 [2018-11-18 15:14:15,369 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:14:15,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-18 15:14:15,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-11-18 15:14:15,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-18 15:14:15,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2018-11-18 15:14:15,374 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 64 [2018-11-18 15:14:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:15,375 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2018-11-18 15:14:15,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 15:14:15,375 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2018-11-18 15:14:15,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 15:14:15,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:15,375 INFO L375 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] [2018-11-18 15:14:15,375 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:15,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:15,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1968245100, now seen corresponding path program 1 times [2018-11-18 15:14:15,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:14:15,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:15,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:14:15,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:15,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:14:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:14:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:14:15,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:14:15,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 15:14:15,431 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:14:15,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 15:14:15,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:14:15,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:14:15,431 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 7 states. [2018-11-18 15:14:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:15,516 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-11-18 15:14:15,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:14:15,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2018-11-18 15:14:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:15,518 INFO L225 Difference]: With dead ends: 109 [2018-11-18 15:14:15,518 INFO L226 Difference]: Without dead ends: 91 [2018-11-18 15:14:15,518 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 15:14:15,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-18 15:14:15,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2018-11-18 15:14:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-18 15:14:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-11-18 15:14:15,523 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 65 [2018-11-18 15:14:15,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:15,523 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-11-18 15:14:15,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 15:14:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-11-18 15:14:15,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 15:14:15,524 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:15,524 INFO L375 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] [2018-11-18 15:14:15,524 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:15,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:15,525 INFO L82 PathProgramCache]: Analyzing trace with hash -603130258, now seen corresponding path program 1 times [2018-11-18 15:14:15,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:14:15,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:15,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:14:15,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:15,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:14:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:14:15,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:14:15,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:14:15,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:14:15,592 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:14:15,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:14:15,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:14:15,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:14:15,593 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 5 states. [2018-11-18 15:14:15,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:15,695 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-11-18 15:14:15,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:14:15,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-18 15:14:15,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:15,696 INFO L225 Difference]: With dead ends: 98 [2018-11-18 15:14:15,696 INFO L226 Difference]: Without dead ends: 78 [2018-11-18 15:14:15,696 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:14:15,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-18 15:14:15,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-18 15:14:15,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-18 15:14:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-11-18 15:14:15,711 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2018-11-18 15:14:15,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:15,711 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-11-18 15:14:15,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:14:15,711 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-11-18 15:14:15,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 15:14:15,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:15,712 INFO L375 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] [2018-11-18 15:14:15,712 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:15,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:15,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1151601388, now seen corresponding path program 1 times [2018-11-18 15:14:15,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:14:15,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:15,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:14:15,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:15,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:14:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:14:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:14:15,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:14:15,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:14:15,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:14:15,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:14:15,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:14:15,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:14:15,774 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 6 states. [2018-11-18 15:14:15,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:15,797 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-11-18 15:14:15,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:14:15,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-11-18 15:14:15,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:15,799 INFO L225 Difference]: With dead ends: 87 [2018-11-18 15:14:15,799 INFO L226 Difference]: Without dead ends: 78 [2018-11-18 15:14:15,799 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:14:15,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-18 15:14:15,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-18 15:14:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-18 15:14:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-11-18 15:14:15,806 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 65 [2018-11-18 15:14:15,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:15,806 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-11-18 15:14:15,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:14:15,807 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-11-18 15:14:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-18 15:14:15,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:14:15,807 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:14:15,807 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:14:15,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:14:15,808 INFO L82 PathProgramCache]: Analyzing trace with hash -42695807, now seen corresponding path program 1 times [2018-11-18 15:14:15,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:14:15,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:15,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:14:15,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:14:15,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:14:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:14:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:14:15,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:14:15,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:14:15,862 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:14:15,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:14:15,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:14:15,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:14:15,863 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 5 states. [2018-11-18 15:14:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:14:15,934 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-11-18 15:14:15,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:14:15,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-18 15:14:15,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:14:15,935 INFO L225 Difference]: With dead ends: 78 [2018-11-18 15:14:15,936 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 15:14:15,936 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:14:15,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 15:14:15,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 15:14:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 15:14:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 15:14:15,937 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2018-11-18 15:14:15,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:14:15,937 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:14:15,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:14:15,937 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:14:15,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 15:14:15,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 15:14:17,822 INFO L428 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 567 574) the Hoare annotation is: true [2018-11-18 15:14:17,822 INFO L425 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 567 574) no Hoare annotation was computed. [2018-11-18 15:14:17,822 INFO L425 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 567 574) no Hoare annotation was computed. [2018-11-18 15:14:17,822 INFO L428 ceAbstractionStarter]: At program point KbFilter_CompleteENTRY(lines 617 627) the Hoare annotation is: true [2018-11-18 15:14:17,822 INFO L428 ceAbstractionStarter]: At program point L623(line 623) the Hoare annotation is: true [2018-11-18 15:14:17,822 INFO L425 ceAbstractionStarter]: For program point L623-1(line 623) no Hoare annotation was computed. [2018-11-18 15:14:17,822 INFO L425 ceAbstractionStarter]: For program point KbFilter_CompleteFINAL(lines 617 627) no Hoare annotation was computed. [2018-11-18 15:14:17,822 INFO L425 ceAbstractionStarter]: For program point KbFilter_CompleteEXIT(lines 617 627) no Hoare annotation was computed. [2018-11-18 15:14:17,822 INFO L425 ceAbstractionStarter]: For program point L702(lines 702 727) no Hoare annotation was computed. [2018-11-18 15:14:17,823 INFO L421 ceAbstractionStarter]: At program point L733(line 733) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2018-11-18 15:14:17,823 INFO L421 ceAbstractionStarter]: At program point L700(lines 699 728) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2018-11-18 15:14:17,823 INFO L425 ceAbstractionStarter]: For program point L733-1(lines 729 735) no Hoare annotation was computed. [2018-11-18 15:14:17,823 INFO L421 ceAbstractionStarter]: At program point L723(lines 698 742) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2018-11-18 15:14:17,823 INFO L425 ceAbstractionStarter]: For program point $Ultimate##10(lines 712 724) no Hoare annotation was computed. [2018-11-18 15:14:17,823 INFO L425 ceAbstractionStarter]: For program point KbFilter_PowerEXIT(lines 688 743) no Hoare annotation was computed. [2018-11-18 15:14:17,823 INFO L421 ceAbstractionStarter]: At program point KbFilter_PowerENTRY(lines 688 743) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2018-11-18 15:14:17,823 INFO L425 ceAbstractionStarter]: For program point L705(lines 705 726) no Hoare annotation was computed. [2018-11-18 15:14:17,823 INFO L425 ceAbstractionStarter]: For program point $Ultimate##9(lines 712 724) no Hoare annotation was computed. [2018-11-18 15:14:17,823 INFO L425 ceAbstractionStarter]: For program point L699(lines 699 728) no Hoare annotation was computed. [2018-11-18 15:14:17,823 INFO L425 ceAbstractionStarter]: For program point KbFilter_PowerFINAL(lines 688 743) no Hoare annotation was computed. [2018-11-18 15:14:17,823 INFO L425 ceAbstractionStarter]: For program point L708(lines 708 725) no Hoare annotation was computed. [2018-11-18 15:14:17,823 INFO L421 ceAbstractionStarter]: At program point L739(line 739) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= ~s~0 ~SKIP1~0) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2018-11-18 15:14:17,824 INFO L425 ceAbstractionStarter]: For program point L739-1(line 739) no Hoare annotation was computed. [2018-11-18 15:14:17,824 INFO L425 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 42 55) no Hoare annotation was computed. [2018-11-18 15:14:17,824 INFO L421 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 42 55) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= ~s~0 1) (<= 1 ~s~0)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) [2018-11-18 15:14:17,824 INFO L425 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 42 55) no Hoare annotation was computed. [2018-11-18 15:14:17,824 INFO L425 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 56 77) no Hoare annotation was computed. [2018-11-18 15:14:17,824 INFO L421 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 56 77) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ~MPR1~0 ~s~0) (= ~s~0 ~MPR3~0) (= ~s~0 |old(~s~0)|) (= ~NP~0 ~s~0) (= ~s~0 ~SKIP1~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 15:14:17,824 INFO L425 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 56 77) no Hoare annotation was computed. [2018-11-18 15:14:17,824 INFO L428 ceAbstractionStarter]: At program point errorFnENTRY(lines 1008 1015) the Hoare annotation is: true [2018-11-18 15:14:17,824 INFO L425 ceAbstractionStarter]: For program point errorFnFINAL(lines 1008 1015) no Hoare annotation was computed. [2018-11-18 15:14:17,824 INFO L425 ceAbstractionStarter]: For program point errorFnEXIT(lines 1008 1015) no Hoare annotation was computed. [2018-11-18 15:14:17,824 INFO L425 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2018-11-18 15:14:17,824 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 456) no Hoare annotation was computed. [2018-11-18 15:14:17,824 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 294 465) no Hoare annotation was computed. [2018-11-18 15:14:17,824 INFO L421 ceAbstractionStarter]: At program point L440(lines 431 458) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 1 ~pended~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 15:14:17,824 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 438) no Hoare annotation was computed. [2018-11-18 15:14:17,824 INFO L425 ceAbstractionStarter]: For program point L399(line 399) no Hoare annotation was computed. [2018-11-18 15:14:17,825 INFO L421 ceAbstractionStarter]: At program point L358(lines 357 410) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 15:14:17,825 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 451) no Hoare annotation was computed. [2018-11-18 15:14:17,825 INFO L421 ceAbstractionStarter]: At program point L375(lines 374 407) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (<= 0 main_~status~1) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 15:14:17,825 INFO L425 ceAbstractionStarter]: For program point L433(lines 433 435) no Hoare annotation was computed. [2018-11-18 15:14:17,825 INFO L425 ceAbstractionStarter]: For program point L367(lines 367 408) no Hoare annotation was computed. [2018-11-18 15:14:17,825 INFO L425 ceAbstractionStarter]: For program point L384(line 384) no Hoare annotation was computed. [2018-11-18 15:14:17,825 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 446) no Hoare annotation was computed. [2018-11-18 15:14:17,825 INFO L425 ceAbstractionStarter]: For program point L343(lines 329 412) no Hoare annotation was computed. [2018-11-18 15:14:17,825 INFO L425 ceAbstractionStarter]: For program point $Ultimate##18(lines 376 406) no Hoare annotation was computed. [2018-11-18 15:14:17,825 INFO L421 ceAbstractionStarter]: At program point L368(lines 367 408) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 15:14:17,825 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 294 465) no Hoare annotation was computed. [2018-11-18 15:14:17,825 INFO L425 ceAbstractionStarter]: For program point $Ultimate##19(lines 376 406) no Hoare annotation was computed. [2018-11-18 15:14:17,826 INFO L421 ceAbstractionStarter]: At program point L327(line 327) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ~MPR1~0 ~s~0) (<= 0 main_~status~1) (= ~s~0 ~MPR3~0) (= ~NP~0 ~s~0) (= ~s~0 ~SKIP1~0))) [2018-11-18 15:14:17,826 INFO L425 ceAbstractionStarter]: For program point L327-1(lines 323 464) no Hoare annotation was computed. [2018-11-18 15:14:17,826 INFO L425 ceAbstractionStarter]: For program point L352(lines 352 411) no Hoare annotation was computed. [2018-11-18 15:14:17,826 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 294 465) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ~MPR1~0 ~s~0) (= ~s~0 ~MPR3~0) (= ~s~0 |old(~s~0)|) (= ~NP~0 ~s~0) (= ~s~0 ~SKIP1~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 15:14:17,826 INFO L425 ceAbstractionStarter]: For program point L394(line 394) no Hoare annotation was computed. [2018-11-18 15:14:17,826 INFO L421 ceAbstractionStarter]: At program point L353(lines 352 411) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 15:14:17,826 INFO L421 ceAbstractionStarter]: At program point L444(line 444) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 15:14:17,826 INFO L421 ceAbstractionStarter]: At program point L428(lines 421 461) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 1 ~pended~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 15:14:17,826 INFO L425 ceAbstractionStarter]: For program point L362(lines 362 409) no Hoare annotation was computed. [2018-11-18 15:14:17,827 INFO L421 ceAbstractionStarter]: At program point L329(lines 323 464) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 1 ~pended~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 15:14:17,827 INFO L425 ceAbstractionStarter]: For program point L453(lines 453 455) no Hoare annotation was computed. [2018-11-18 15:14:17,827 INFO L421 ceAbstractionStarter]: At program point L420(lines 413 462) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 1 ~pended~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 15:14:17,827 INFO L425 ceAbstractionStarter]: For program point L379(line 379) no Hoare annotation was computed. [2018-11-18 15:14:17,827 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 341) no Hoare annotation was computed. [2018-11-18 15:14:17,827 INFO L421 ceAbstractionStarter]: At program point L338-2(lines 338 341) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1) (= ~NP~0 ~s~0) (<= ~s~0 1) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 15:14:17,827 INFO L425 ceAbstractionStarter]: For program point L429(lines 413 462) no Hoare annotation was computed. [2018-11-18 15:14:17,827 INFO L421 ceAbstractionStarter]: At program point L363(lines 362 409) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1) (= ~NP~0 ~s~0) (<= ~s~0 1) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 15:14:17,827 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 407) no Hoare annotation was computed. [2018-11-18 15:14:17,827 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 459) no Hoare annotation was computed. [2018-11-18 15:14:17,827 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 426) no Hoare annotation was computed. [2018-11-18 15:14:17,828 INFO L425 ceAbstractionStarter]: For program point L389(line 389) no Hoare annotation was computed. [2018-11-18 15:14:17,828 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 418) no Hoare annotation was computed. [2018-11-18 15:14:17,828 INFO L421 ceAbstractionStarter]: At program point L373(lines 372 407) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 15:14:17,828 INFO L425 ceAbstractionStarter]: For program point L431(lines 431 458) no Hoare annotation was computed. [2018-11-18 15:14:17,828 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 410) no Hoare annotation was computed. [2018-11-18 15:14:17,828 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 548) no Hoare annotation was computed. [2018-11-18 15:14:17,828 INFO L425 ceAbstractionStarter]: For program point L494(lines 494 498) no Hoare annotation was computed. [2018-11-18 15:14:17,828 INFO L421 ceAbstractionStarter]: At program point L523(lines 487 551) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (= ~s~0 ~SKIP1~0) .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) (let ((.cse1 (= ~MPR1~0 ~s~0)) (.cse2 (= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)))) (or (< ~MPR3~0 (+ ~NP~0 5)) (and .cse1 .cse2 (= IofCallDriver_~returnVal2~0 259) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse0 (and .cse1 .cse2 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0)) (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) (and .cse1 .cse2 (= 0 IofCallDriver_~returnVal2~0)) (< |old(~s~0)| 1))))) [2018-11-18 15:14:17,828 INFO L421 ceAbstractionStarter]: At program point L490(line 490) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse0 (and (<= ~s~0 1) (<= 1 ~s~0)) (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) (< |old(~s~0)| 1)))) [2018-11-18 15:14:17,828 INFO L425 ceAbstractionStarter]: For program point L490-1(line 490) no Hoare annotation was computed. [2018-11-18 15:14:17,829 INFO L421 ceAbstractionStarter]: At program point L511(lines 510 525) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse0 (and (= ~MPR1~0 ~s~0) (= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) (< |old(~s~0)| 1)) (or (= ~s~0 ~SKIP1~0) .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2018-11-18 15:14:17,829 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 547) no Hoare annotation was computed. [2018-11-18 15:14:17,829 INFO L425 ceAbstractionStarter]: For program point L503(lines 503 526) no Hoare annotation was computed. [2018-11-18 15:14:17,829 INFO L425 ceAbstractionStarter]: For program point L532(lines 532 538) no Hoare annotation was computed. [2018-11-18 15:14:17,829 INFO L421 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 480 552) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (= ~s~0 ~SKIP1~0) .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse0 (and (<= ~s~0 1) (<= 1 ~s~0)) (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) (< |old(~s~0)| 1)))) [2018-11-18 15:14:17,829 INFO L425 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 480 552) no Hoare annotation was computed. [2018-11-18 15:14:17,829 INFO L421 ceAbstractionStarter]: At program point L545(line 545) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse0 (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) (< |old(~s~0)| 1)) (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2018-11-18 15:14:17,829 INFO L425 ceAbstractionStarter]: For program point L545-1(lines 527 549) no Hoare annotation was computed. [2018-11-18 15:14:17,829 INFO L425 ceAbstractionStarter]: For program point L508(lines 508 525) no Hoare annotation was computed. [2018-11-18 15:14:17,829 INFO L421 ceAbstractionStarter]: At program point L504(lines 503 526) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse0 (< ~MPR1~0 (+ ~NP~0 4)) (and (= ~MPR1~0 ~s~0) (= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (< ~compRegistered~0 1) (< 1 ~NP~0) (< |old(~s~0)| 1)) (or (= ~s~0 ~SKIP1~0) .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2018-11-18 15:14:17,830 INFO L425 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 480 552) no Hoare annotation was computed. [2018-11-18 15:14:17,830 INFO L421 ceAbstractionStarter]: At program point L496(line 496) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse0 (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) (< |old(~s~0)| 1) (and (= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (= ~NP~0 ~s~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2018-11-18 15:14:17,830 INFO L425 ceAbstractionStarter]: For program point L488(lines 488 500) no Hoare annotation was computed. [2018-11-18 15:14:17,830 INFO L425 ceAbstractionStarter]: For program point L488-1(lines 488 500) no Hoare annotation was computed. [2018-11-18 15:14:17,830 INFO L425 ceAbstractionStarter]: For program point $Ultimate##12(lines 512 524) no Hoare annotation was computed. [2018-11-18 15:14:17,830 INFO L425 ceAbstractionStarter]: For program point $Ultimate##11(lines 512 524) no Hoare annotation was computed. [2018-11-18 15:14:17,830 INFO L421 ceAbstractionStarter]: At program point L509(lines 508 525) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (< ~MPR3~0 (+ ~NP~0 5)) (and (= ~MPR1~0 ~s~0) (= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse0 (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) (< |old(~s~0)| 1)) (or (= ~s~0 ~SKIP1~0) .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2018-11-18 15:14:17,830 INFO L421 ceAbstractionStarter]: At program point L474(line 474) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~setEventCalled~0 1) (< ~NP~0 1) (< 1 |old(~s~0)|) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0)) [2018-11-18 15:14:17,830 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 466 479) no Hoare annotation was computed. [2018-11-18 15:14:17,831 INFO L421 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 466 479) the Hoare annotation is: (or (= ~NP~0 ~s~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~setEventCalled~0 1) (< ~NP~0 1) (< 1 |old(~s~0)|) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0)) [2018-11-18 15:14:17,831 INFO L425 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 466 479) no Hoare annotation was computed. [2018-11-18 15:14:17,831 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 805) no Hoare annotation was computed. [2018-11-18 15:14:17,831 INFO L425 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 744 820) no Hoare annotation was computed. [2018-11-18 15:14:17,831 INFO L425 ceAbstractionStarter]: For program point L808(lines 808 815) no Hoare annotation was computed. [2018-11-18 15:14:17,831 INFO L425 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 744 820) no Hoare annotation was computed. [2018-11-18 15:14:17,831 INFO L425 ceAbstractionStarter]: For program point L796(lines 796 816) no Hoare annotation was computed. [2018-11-18 15:14:17,831 INFO L425 ceAbstractionStarter]: For program point L759(lines 759 763) no Hoare annotation was computed. [2018-11-18 15:14:17,831 INFO L421 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 744 820) the Hoare annotation is: (or (= ~s~0 ~SKIP1~0) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2018-11-18 15:14:17,831 INFO L421 ceAbstractionStarter]: At program point L788(lines 752 819) the Hoare annotation is: (or (= ~s~0 ~SKIP1~0) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2018-11-18 15:14:17,831 INFO L421 ceAbstractionStarter]: At program point L755(line 755) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2018-11-18 15:14:17,831 INFO L425 ceAbstractionStarter]: For program point L755-1(line 755) no Hoare annotation was computed. [2018-11-18 15:14:17,831 INFO L421 ceAbstractionStarter]: At program point L813(line 813) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2018-11-18 15:14:17,832 INFO L425 ceAbstractionStarter]: For program point L813-1(lines 792 817) no Hoare annotation was computed. [2018-11-18 15:14:17,832 INFO L421 ceAbstractionStarter]: At program point L776(lines 775 790) the Hoare annotation is: (or (= ~s~0 ~SKIP1~0) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2018-11-18 15:14:17,832 INFO L425 ceAbstractionStarter]: For program point L768(lines 768 791) no Hoare annotation was computed. [2018-11-18 15:14:17,832 INFO L425 ceAbstractionStarter]: For program point L773(lines 773 790) no Hoare annotation was computed. [2018-11-18 15:14:17,832 INFO L425 ceAbstractionStarter]: For program point $Ultimate##12(lines 777 789) no Hoare annotation was computed. [2018-11-18 15:14:17,832 INFO L425 ceAbstractionStarter]: For program point $Ultimate##11(lines 777 789) no Hoare annotation was computed. [2018-11-18 15:14:17,832 INFO L421 ceAbstractionStarter]: At program point L769(lines 768 791) the Hoare annotation is: (or (= ~s~0 ~SKIP1~0) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2018-11-18 15:14:17,832 INFO L421 ceAbstractionStarter]: At program point L761(line 761) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2018-11-18 15:14:17,832 INFO L425 ceAbstractionStarter]: For program point L753(lines 753 765) no Hoare annotation was computed. [2018-11-18 15:14:17,832 INFO L425 ceAbstractionStarter]: For program point L753-1(lines 753 765) no Hoare annotation was computed. [2018-11-18 15:14:17,832 INFO L421 ceAbstractionStarter]: At program point L774(lines 773 790) the Hoare annotation is: (or (= ~s~0 ~SKIP1~0) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2018-11-18 15:14:17,833 INFO L425 ceAbstractionStarter]: For program point L640(lines 640 654) no Hoare annotation was computed. [2018-11-18 15:14:17,833 INFO L421 ceAbstractionStarter]: At program point L659(line 659) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2018-11-18 15:14:17,833 INFO L425 ceAbstractionStarter]: For program point KbFilter_CreateCloseEXIT(lines 628 663) no Hoare annotation was computed. [2018-11-18 15:14:17,833 INFO L425 ceAbstractionStarter]: For program point L659-1(line 659) no Hoare annotation was computed. [2018-11-18 15:14:17,833 INFO L425 ceAbstractionStarter]: For program point L643(lines 643 653) no Hoare annotation was computed. [2018-11-18 15:14:17,833 INFO L425 ceAbstractionStarter]: For program point L637(lines 637 655) no Hoare annotation was computed. [2018-11-18 15:14:17,833 INFO L421 ceAbstractionStarter]: At program point KbFilter_CreateCloseENTRY(lines 628 663) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2018-11-18 15:14:17,833 INFO L425 ceAbstractionStarter]: For program point KbFilter_CreateCloseFINAL(lines 628 663) no Hoare annotation was computed. [2018-11-18 15:14:17,833 INFO L421 ceAbstractionStarter]: At program point L652(lines 640 654) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2018-11-18 15:14:17,833 INFO L421 ceAbstractionStarter]: At program point L644(lines 637 655) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2018-11-18 15:14:17,833 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:14:17,833 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~s~0 |old(~s~0)|) [2018-11-18 15:14:17,833 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:14:17,834 INFO L425 ceAbstractionStarter]: For program point L923(lines 923 975) no Hoare annotation was computed. [2018-11-18 15:14:17,834 INFO L425 ceAbstractionStarter]: For program point L890(lines 890 985) no Hoare annotation was computed. [2018-11-18 15:14:17,834 INFO L425 ceAbstractionStarter]: For program point L882(lines 882 987) no Hoare annotation was computed. [2018-11-18 15:14:17,834 INFO L425 ceAbstractionStarter]: For program point KbFilter_InternIoCtlEXIT(lines 821 1006) no Hoare annotation was computed. [2018-11-18 15:14:17,834 INFO L425 ceAbstractionStarter]: For program point L874(lines 874 989) no Hoare annotation was computed. [2018-11-18 15:14:17,834 INFO L421 ceAbstractionStarter]: At program point L1002(line 1002) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2018-11-18 15:14:17,834 INFO L425 ceAbstractionStarter]: For program point L1002-1(line 1002) no Hoare annotation was computed. [2018-11-18 15:14:17,834 INFO L425 ceAbstractionStarter]: For program point L895(lines 895 983) no Hoare annotation was computed. [2018-11-18 15:14:17,834 INFO L421 ceAbstractionStarter]: At program point L891(lines 890 985) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2018-11-18 15:14:17,834 INFO L425 ceAbstractionStarter]: For program point L916(lines 916 977) no Hoare annotation was computed. [2018-11-18 15:14:17,834 INFO L421 ceAbstractionStarter]: At program point L883(lines 882 987) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2018-11-18 15:14:17,834 INFO L425 ceAbstractionStarter]: For program point L933(lines 933 972) no Hoare annotation was computed. [2018-11-18 15:14:17,834 INFO L425 ceAbstractionStarter]: For program point L958-1(lines 958 960) no Hoare annotation was computed. [2018-11-18 15:14:17,834 INFO L425 ceAbstractionStarter]: For program point L909(lines 909 979) no Hoare annotation was computed. [2018-11-18 15:14:17,834 INFO L421 ceAbstractionStarter]: At program point L971(lines 866 1005) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2018-11-18 15:14:17,834 INFO L421 ceAbstractionStarter]: At program point L934(lines 874 989) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2018-11-18 15:14:17,834 INFO L421 ceAbstractionStarter]: At program point L996(line 996) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2018-11-18 15:14:17,834 INFO L425 ceAbstractionStarter]: For program point L996-1(line 996) no Hoare annotation was computed. [2018-11-18 15:14:17,834 INFO L425 ceAbstractionStarter]: For program point L930(lines 930 973) no Hoare annotation was computed. [2018-11-18 15:14:17,842 INFO L425 ceAbstractionStarter]: For program point L955(lines 955 957) no Hoare annotation was computed. [2018-11-18 15:14:17,842 INFO L425 ceAbstractionStarter]: For program point L955-2(lines 933 970) no Hoare annotation was computed. [2018-11-18 15:14:17,842 INFO L421 ceAbstractionStarter]: At program point KbFilter_InternIoCtlENTRY(lines 821 1006) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2018-11-18 15:14:17,842 INFO L425 ceAbstractionStarter]: For program point L939(lines 939 942) no Hoare annotation was computed. [2018-11-18 15:14:17,842 INFO L425 ceAbstractionStarter]: For program point L902(lines 902 981) no Hoare annotation was computed. [2018-11-18 15:14:17,842 INFO L425 ceAbstractionStarter]: For program point KbFilter_InternIoCtlFINAL(lines 821 1006) no Hoare annotation was computed. [2018-11-18 15:14:17,843 INFO L421 ceAbstractionStarter]: At program point L605(lines 604 614) the Hoare annotation is: (let ((.cse1 (= 1 ~pended~0))) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (and (not .cse1) (= ~s~0 ~NP~0))) (.cse3 (< ~MPR1~0 (+ ~NP~0 4))) (.cse4 (< ~compRegistered~0 1))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) (or .cse0 (< |old(~setEventCalled~0)| 1) (< ~NP~0 1) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~MPR3~0)) .cse4 (< 1 ~NP~0) (< 1 |old(~setEventCalled~0)|))))) [2018-11-18 15:14:17,843 INFO L421 ceAbstractionStarter]: At program point L603(lines 602 614) the Hoare annotation is: (let ((.cse1 (= 1 ~pended~0))) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (and (not .cse1) (= ~s~0 ~NP~0))) (.cse3 (< ~MPR1~0 (+ ~NP~0 4))) (.cse4 (< ~compRegistered~0 1))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) (or .cse0 (< |old(~setEventCalled~0)| 1) (< ~NP~0 1) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~MPR3~0)) .cse4 (< 1 ~NP~0) (< 1 |old(~setEventCalled~0)|))))) [2018-11-18 15:14:17,843 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 575 616) no Hoare annotation was computed. [2018-11-18 15:14:17,843 INFO L421 ceAbstractionStarter]: At program point L595(line 595) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 ~pended~0)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~compRegistered~0 1))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3) (or .cse0 (< |old(~setEventCalled~0)| 1) (< ~NP~0 1) .cse1 .cse2 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (< 1 ~NP~0) (< 1 |old(~setEventCalled~0)|)))) [2018-11-18 15:14:17,843 INFO L425 ceAbstractionStarter]: For program point L593(lines 593 597) no Hoare annotation was computed. [2018-11-18 15:14:17,843 INFO L425 ceAbstractionStarter]: For program point L593-1(lines 580 599) no Hoare annotation was computed. [2018-11-18 15:14:17,843 INFO L425 ceAbstractionStarter]: For program point $Ultimate##16(lines 606 613) no Hoare annotation was computed. [2018-11-18 15:14:17,843 INFO L425 ceAbstractionStarter]: For program point $Ultimate##15(lines 606 613) no Hoare annotation was computed. [2018-11-18 15:14:17,844 INFO L425 ceAbstractionStarter]: For program point L581(lines 581 586) no Hoare annotation was computed. [2018-11-18 15:14:17,844 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 575 616) no Hoare annotation was computed. [2018-11-18 15:14:17,844 INFO L425 ceAbstractionStarter]: For program point L602(lines 602 614) no Hoare annotation was computed. [2018-11-18 15:14:17,844 INFO L421 ceAbstractionStarter]: At program point L588(lines 580 599) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 ~pended~0)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~compRegistered~0 1))) (and (or .cse0 (< |old(~setEventCalled~0)| 1) (< ~NP~0 1) .cse1 .cse2 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (< 1 ~NP~0) (< 1 |old(~setEventCalled~0)|)) (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 (= ~s~0 ~NP~0) .cse3))) [2018-11-18 15:14:17,844 INFO L421 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 575 616) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 ~pended~0)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~compRegistered~0 1))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 (= ~NP~0 ~s~0)) (or .cse0 (< |old(~setEventCalled~0)| 1) (< ~NP~0 1) .cse1 (and (= ~s~0 |old(~s~0)|) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse2 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (< 1 ~NP~0) (< 1 |old(~setEventCalled~0)|)))) [2018-11-18 15:14:17,844 INFO L425 ceAbstractionStarter]: For program point L580(lines 580 599) no Hoare annotation was computed. [2018-11-18 15:14:17,844 INFO L421 ceAbstractionStarter]: At program point L561(line 561) the Hoare annotation is: (let ((.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= 1 ~pended~0))) (and (or .cse0 .cse1 (< ~compRegistered~0 1)) (or .cse0 .cse1 (not (= ~compRegistered~0 0))))) [2018-11-18 15:14:17,844 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 553 566) no Hoare annotation was computed. [2018-11-18 15:14:17,844 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 563) no Hoare annotation was computed. [2018-11-18 15:14:17,844 INFO L421 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 553 566) the Hoare annotation is: (let ((.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (= ~s~0 ~NP~0))) (and (or .cse0 .cse1 .cse2 (< ~compRegistered~0 1)) (or .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse2))) [2018-11-18 15:14:17,845 INFO L425 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 553 566) no Hoare annotation was computed. [2018-11-18 15:14:17,845 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:14:17,845 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ~MPR1~0 ~s~0) (= ~s~0 ~MPR3~0) (= ~NP~0 ~s~0) (= ~s~0 ~SKIP1~0)) [2018-11-18 15:14:17,845 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 15:14:17,845 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:14:17,845 INFO L421 ceAbstractionStarter]: At program point KbFilter_DispatchPassThroughENTRY(lines 664 687) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2018-11-18 15:14:17,845 INFO L425 ceAbstractionStarter]: For program point L673(lines 673 679) no Hoare annotation was computed. [2018-11-18 15:14:17,845 INFO L421 ceAbstractionStarter]: At program point L683(line 683) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= ~s~0 ~SKIP1~0) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2018-11-18 15:14:17,845 INFO L425 ceAbstractionStarter]: For program point L683-1(line 683) no Hoare annotation was computed. [2018-11-18 15:14:17,845 INFO L425 ceAbstractionStarter]: For program point KbFilter_DispatchPassThroughFINAL(lines 664 687) no Hoare annotation was computed. [2018-11-18 15:14:17,845 INFO L421 ceAbstractionStarter]: At program point L677(line 677) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2018-11-18 15:14:17,845 INFO L425 ceAbstractionStarter]: For program point L677-1(lines 673 679) no Hoare annotation was computed. [2018-11-18 15:14:17,845 INFO L425 ceAbstractionStarter]: For program point KbFilter_DispatchPassThroughEXIT(lines 664 687) no Hoare annotation was computed. [2018-11-18 15:14:17,846 INFO L421 ceAbstractionStarter]: At program point L217(line 217) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) [2018-11-18 15:14:17,846 INFO L421 ceAbstractionStarter]: At program point L242(line 242) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) [2018-11-18 15:14:17,846 INFO L425 ceAbstractionStarter]: For program point L242-1(lines 238 244) no Hoare annotation was computed. [2018-11-18 15:14:17,846 INFO L425 ceAbstractionStarter]: For program point L176(lines 176 188) no Hoare annotation was computed. [2018-11-18 15:14:17,846 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 278) no Hoare annotation was computed. [2018-11-18 15:14:17,846 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 289) no Hoare annotation was computed. [2018-11-18 15:14:17,846 INFO L421 ceAbstractionStarter]: At program point L226(line 226) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) [2018-11-18 15:14:17,846 INFO L421 ceAbstractionStarter]: At program point L193(lines 193 194) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (= 1 ~pended~0) (and (<= 1 ~compRegistered~0) (= KbFilter_PnP_~status~0 0) (<= ~s~0 1) (<= 1 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) [2018-11-18 15:14:17,846 INFO L425 ceAbstractionStarter]: For program point L226-1(lines 222 228) no Hoare annotation was computed. [2018-11-18 15:14:17,846 INFO L425 ceAbstractionStarter]: For program point L193-1(lines 193 194) no Hoare annotation was computed. [2018-11-18 15:14:17,846 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 275) no Hoare annotation was computed. [2018-11-18 15:14:17,847 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 286) no Hoare annotation was computed. [2018-11-18 15:14:17,847 INFO L421 ceAbstractionStarter]: At program point L111(lines 110 289) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) [2018-11-18 15:14:17,847 INFO L428 ceAbstractionStarter]: At program point L268(lines 171 269) the Hoare annotation is: true [2018-11-18 15:14:17,847 INFO L425 ceAbstractionStarter]: For program point L161(lines 161 272) no Hoare annotation was computed. [2018-11-18 15:14:17,847 INFO L425 ceAbstractionStarter]: For program point L128(lines 128 283) no Hoare annotation was computed. [2018-11-18 15:14:17,847 INFO L421 ceAbstractionStarter]: At program point L178(line 178) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) [2018-11-18 15:14:17,847 INFO L425 ceAbstractionStarter]: For program point KbFilter_PnPEXIT(lines 80 293) no Hoare annotation was computed. [2018-11-18 15:14:17,847 INFO L421 ceAbstractionStarter]: At program point L170(lines 116 287) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) [2018-11-18 15:14:17,847 INFO L425 ceAbstractionStarter]: For program point L137(lines 137 280) no Hoare annotation was computed. [2018-11-18 15:14:17,847 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 277) no Hoare annotation was computed. [2018-11-18 15:14:17,847 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 288) no Hoare annotation was computed. [2018-11-18 15:14:17,848 INFO L421 ceAbstractionStarter]: At program point KbFilter_PnPENTRY(lines 80 293) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (and (= 0 ~compRegistered~0) (<= ~s~0 1) (<= 1 ~s~0)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) [2018-11-18 15:14:17,848 INFO L425 ceAbstractionStarter]: For program point KbFilter_PnPFINAL(lines 80 293) no Hoare annotation was computed. [2018-11-18 15:14:17,848 INFO L425 ceAbstractionStarter]: For program point L155(lines 155 274) no Hoare annotation was computed. [2018-11-18 15:14:17,848 INFO L425 ceAbstractionStarter]: For program point L122(lines 122 285) no Hoare annotation was computed. [2018-11-18 15:14:17,848 INFO L421 ceAbstractionStarter]: At program point L114(lines 113 288) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) [2018-11-18 15:14:17,848 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 244) no Hoare annotation was computed. [2018-11-18 15:14:17,848 INFO L421 ceAbstractionStarter]: At program point L263(lines 263 264) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (and (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) [2018-11-18 15:14:17,848 INFO L425 ceAbstractionStarter]: For program point L263-1(lines 263 264) no Hoare annotation was computed. [2018-11-18 15:14:17,848 INFO L425 ceAbstractionStarter]: For program point L164(lines 164 271) no Hoare annotation was computed. [2018-11-18 15:14:17,848 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 282) no Hoare annotation was computed. [2018-11-18 15:14:17,848 INFO L425 ceAbstractionStarter]: For program point L222(lines 222 228) no Hoare annotation was computed. [2018-11-18 15:14:17,848 INFO L425 ceAbstractionStarter]: For program point L181(lines 181 187) no Hoare annotation was computed. [2018-11-18 15:14:17,848 INFO L425 ceAbstractionStarter]: For program point L181-1(lines 176 188) no Hoare annotation was computed. [2018-11-18 15:14:17,849 INFO L425 ceAbstractionStarter]: For program point L206(lines 206 212) no Hoare annotation was computed. [2018-11-18 15:14:17,849 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 279) no Hoare annotation was computed. [2018-11-18 15:14:17,849 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 290) no Hoare annotation was computed. [2018-11-18 15:14:17,849 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 204) no Hoare annotation was computed. [2018-11-18 15:14:17,849 INFO L425 ceAbstractionStarter]: For program point L198-2(lines 171 267) no Hoare annotation was computed. [2018-11-18 15:14:17,849 INFO L421 ceAbstractionStarter]: At program point L248(line 248) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (and (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) [2018-11-18 15:14:17,849 INFO L425 ceAbstractionStarter]: For program point L248-1(line 248) no Hoare annotation was computed. [2018-11-18 15:14:17,849 INFO L425 ceAbstractionStarter]: For program point L149(lines 149 276) no Hoare annotation was computed. [2018-11-18 15:14:17,849 INFO L425 ceAbstractionStarter]: For program point L116(lines 116 287) no Hoare annotation was computed. [2018-11-18 15:14:17,849 INFO L425 ceAbstractionStarter]: For program point L207(lines 207 211) no Hoare annotation was computed. [2018-11-18 15:14:17,849 INFO L421 ceAbstractionStarter]: At program point L108(lines 107 290) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= KbFilter_PnP_~status~0 0) (= ~NP~0 ~s~0)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) [2018-11-18 15:14:17,849 INFO L421 ceAbstractionStarter]: At program point L232(lines 232 233) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (and (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) [2018-11-18 15:14:17,850 INFO L425 ceAbstractionStarter]: For program point L232-1(lines 232 233) no Hoare annotation was computed. [2018-11-18 15:14:17,850 INFO L421 ceAbstractionStarter]: At program point L257(line 257) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) [2018-11-18 15:14:17,850 INFO L425 ceAbstractionStarter]: For program point L257-1(lines 253 259) no Hoare annotation was computed. [2018-11-18 15:14:17,850 INFO L425 ceAbstractionStarter]: For program point L158(lines 158 273) no Hoare annotation was computed. [2018-11-18 15:14:17,850 INFO L425 ceAbstractionStarter]: For program point L125(lines 125 284) no Hoare annotation was computed. [2018-11-18 15:14:17,850 INFO L421 ceAbstractionStarter]: At program point L183(line 183) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) [2018-11-18 15:14:17,850 INFO L425 ceAbstractionStarter]: For program point $Ultimate##43(lines 171 269) no Hoare annotation was computed. [2018-11-18 15:14:17,850 INFO L421 ceAbstractionStarter]: At program point L200(lines 200 202) the Hoare annotation is: (let ((.cse0 (<= 1 ~compRegistered~0))) (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (and (<= 259 KbFilter_PnP_~status~0) (= ~s~0 ~MPR3~0) .cse0 (= 259 KbFilter_PnP_~__cil_tmp23~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (and (= ~NP~0 ~s~0) .cse0))) [2018-11-18 15:14:17,850 INFO L425 ceAbstractionStarter]: For program point L167(lines 167 270) no Hoare annotation was computed. [2018-11-18 15:14:17,850 INFO L425 ceAbstractionStarter]: For program point L200-1(lines 200 202) no Hoare annotation was computed. [2018-11-18 15:14:17,850 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 281) no Hoare annotation was computed. [2018-11-18 15:14:17,850 INFO L425 ceAbstractionStarter]: For program point $Ultimate##44(lines 171 269) no Hoare annotation was computed. [2018-11-18 15:14:17,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 03:14:17 BoogieIcfgContainer [2018-11-18 15:14:17,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 15:14:17,898 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:14:17,898 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:14:17,898 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:14:17,898 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:14:13" (3/4) ... [2018-11-18 15:14:17,903 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 15:14:17,910 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-18 15:14:17,910 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_Complete [2018-11-18 15:14:17,910 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_Power [2018-11-18 15:14:17,910 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-18 15:14:17,910 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-18 15:14:17,910 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-18 15:14:17,910 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 15:14:17,910 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-18 15:14:17,910 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-18 15:14:17,911 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-11-18 15:14:17,911 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_CreateClose [2018-11-18 15:14:17,911 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 15:14:17,911 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_InternIoCtl [2018-11-18 15:14:17,911 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-18 15:14:17,911 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-18 15:14:17,911 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_DispatchPassThrough [2018-11-18 15:14:17,911 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_PnP [2018-11-18 15:14:17,922 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2018-11-18 15:14:17,923 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2018-11-18 15:14:17,923 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 15:14:17,949 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) [2018-11-18 15:14:17,949 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) [2018-11-18 15:14:17,949 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) [2018-11-18 15:14:17,949 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) [2018-11-18 15:14:17,950 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) [2018-11-18 15:14:17,950 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((MPR3 < NP + 5 || !(\old(s) == NP)) || 1 == pended) || (!(1 == pended) && s == NP)) || MPR1 < NP + 4) || compRegistered < 1) && (((((((((MPR3 < NP + 5 || \old(setEventCalled) < 1) || NP < 1) || 1 == pended) || (!(1 == pended) && s == NP)) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < NP) || 1 < \old(setEventCalled)) [2018-11-18 15:14:17,951 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((MPR3 < NP + 5 || !(\old(s) == NP)) || 1 == pended) || (!(1 == pended) && s == NP)) || MPR1 < NP + 4) || compRegistered < 1) && (((((((((MPR3 < NP + 5 || \old(setEventCalled) < 1) || NP < 1) || 1 == pended) || (!(1 == pended) && s == NP)) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < NP) || 1 < \old(setEventCalled)) [2018-11-18 15:14:17,951 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((MPR3 < NP + 5 || NP < 1) || 1 < \old(s)) || 1 == pended) || MPR1 < NP + 4) || (MPR1 == s && 0 == __cil_tmp7 + 1073741802)) || compRegistered < 1) || 1 < NP) || \old(s) < 1) && (((s == SKIP1 || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) [2018-11-18 15:14:17,951 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((s == SKIP1 || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s)) [2018-11-18 15:14:17,951 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((s == SKIP1 || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) && ((((((((((MPR3 < NP + 5 || ((((MPR1 == s && 0 == __cil_tmp7 + 1073741802) && returnVal2 == 259) && 1 <= setEventCalled) && setEventCalled <= 1)) || NP < 1) || 1 < \old(s)) || 1 == pended) || ((MPR1 == s && 0 == __cil_tmp7 + 1073741802) && returnVal2 + 1073741823 <= 0)) || MPR1 < NP + 4) || compRegistered < 1) || 1 < NP) || ((MPR1 == s && 0 == __cil_tmp7 + 1073741802) && 0 == returnVal2)) || \old(s) < 1) [2018-11-18 15:14:17,951 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((s == SKIP1 || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s)) [2018-11-18 15:14:17,951 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) [2018-11-18 15:14:17,952 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((MPR3 < NP + 5 || \old(setEventCalled) < 1) || NP < 1) || 1 == pended) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < NP) || 1 < \old(setEventCalled)) && (((((MPR3 < NP + 5 || !(\old(s) == NP)) || 1 == pended) || MPR1 < NP + 4) || s == NP) || compRegistered < 1) [2018-11-18 15:14:17,952 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((MPR3 < NP + 5 || (MPR1 == s && 0 == __cil_tmp7 + 1073741802)) || NP < 1) || 1 < \old(s)) || 1 == pended) || MPR1 < NP + 4) || compRegistered < 1) || 1 < NP) || \old(s) < 1) && (((s == SKIP1 || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) [2018-11-18 15:14:17,952 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((MPR3 < NP + 5 || NP < 1) || 1 < \old(s)) || 1 == pended) || (((MPR1 == s && 0 == __cil_tmp7 + 1073741802) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR1 < NP + 4) || compRegistered < 1) || 1 < NP) || \old(s) < 1) && (((s == SKIP1 || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) [2018-11-18 15:14:17,952 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((s == SKIP1 || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s)) [2018-11-18 15:14:17,952 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((s == SKIP1 || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s)) [2018-11-18 15:14:17,953 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(1 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && 0 <= status) && NP == s) && s <= 1) && 1 <= s) && NP + 4 <= MPR1) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) [2018-11-18 15:14:17,953 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP [2018-11-18 15:14:17,953 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP [2018-11-18 15:14:17,953 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) [2018-11-18 15:14:17,953 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) [2018-11-18 15:14:17,954 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(\old(s) == \old(NP)) || 0 <= status) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) [2018-11-18 15:14:17,954 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP [2018-11-18 15:14:17,954 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP [2018-11-18 15:14:17,955 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == compRegistered && status == 0) && NP == s) || MPR3 < NP + 5) || NP < 1) || 1 < \old(s)) || 1 == pended) || !(\old(compRegistered) == 0)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1 [2018-11-18 15:14:17,955 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((MPR3 < NP + 5 || NP < 1) || 1 < \old(s)) || 1 == pended) || !(\old(compRegistered) == 0)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || (s == NP && 0 == compRegistered) [2018-11-18 15:14:17,955 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((MPR3 < NP + 5 || NP < 1) || 1 < \old(s)) || 1 == pended) || !(\old(compRegistered) == 0)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || (s == NP && 0 == compRegistered) [2018-11-18 15:14:17,955 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((MPR3 < NP + 5 || NP < 1) || 1 < \old(s)) || 1 == pended) || !(\old(compRegistered) == 0)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || (s == NP && 0 == compRegistered) [2018-11-18 15:14:17,956 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP [2018-11-18 15:14:17,956 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP [2018-11-18 15:14:17,956 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP [2018-11-18 15:14:17,956 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP [2018-11-18 15:14:18,023 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7833fe68-aed8-44ea-a573-0962e3ae48e3/bin-2019/utaipan/witness.graphml [2018-11-18 15:14:18,023 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:14:18,024 INFO L168 Benchmark]: Toolchain (without parser) took 5601.50 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.9 MB). Free memory was 961.9 MB in the beginning and 1.2 GB in the end (delta: -245.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:14:18,025 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:14:18,025 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.79 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 935.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-18 15:14:18,025 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -200.0 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:14:18,026 INFO L168 Benchmark]: Boogie Preprocessor took 32.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:14:18,026 INFO L168 Benchmark]: RCFGBuilder took 621.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. [2018-11-18 15:14:18,026 INFO L168 Benchmark]: TraceAbstraction took 4452.23 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 93.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -162.6 MB). Peak memory consumption was 245.1 MB. Max. memory is 11.5 GB. [2018-11-18 15:14:18,026 INFO L168 Benchmark]: Witness Printer took 125.82 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-18 15:14:18,032 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.79 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 935.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -200.0 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 621.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4452.23 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 93.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -162.6 MB). Peak memory consumption was 245.1 MB. Max. memory is 11.5 GB. * Witness Printer took 125.82 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1012]: 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: 362]: Loop Invariant Derived loop invariant: ((((((((((((!(1 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && 0 <= status) && NP == s) && s <= 1) && 1 <= s) && NP + 4 <= MPR1) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 640]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((MPR3 < NP + 5 || NP < 1) || 1 < \old(s)) || 1 == pended) || !(\old(compRegistered) == 0)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || (s == NP && 0 == compRegistered) - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: (((((((((0 == compRegistered && status == 0) && NP == s) || MPR3 < NP + 5) || NP < 1) || 1 < \old(s)) || 1 == pended) || !(\old(compRegistered) == 0)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1 - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: ((((((((MPR3 < NP + 5 || \old(setEventCalled) < 1) || NP < 1) || 1 == pended) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < NP) || 1 < \old(setEventCalled)) && (((((MPR3 < NP + 5 || !(\old(s) == NP)) || 1 == pended) || MPR1 < NP + 4) || s == NP) || compRegistered < 1) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 752]: Loop Invariant Derived loop invariant: ((s == SKIP1 || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s)) - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 768]: Loop Invariant Derived loop invariant: ((s == SKIP1 || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s)) - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: ((((((((MPR3 < NP + 5 || NP < 1) || 1 < \old(s)) || 1 == pended) || (((MPR1 == s && 0 == __cil_tmp7 + 1073741802) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR1 < NP + 4) || compRegistered < 1) || 1 < NP) || \old(s) < 1) && (((s == SKIP1 || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: ((((((((MPR3 < NP + 5 || (MPR1 == s && 0 == __cil_tmp7 + 1073741802)) || NP < 1) || 1 < \old(s)) || 1 == pended) || MPR1 < NP + 4) || compRegistered < 1) || 1 < NP) || \old(s) < 1) && (((s == SKIP1 || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 773]: Loop Invariant Derived loop invariant: ((s == SKIP1 || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s)) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 421]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(NP)) || 0 <= status) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 866]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 882]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((MPR3 < NP + 5 || NP < 1) || 1 < \old(s)) || 1 == pended) || !(\old(compRegistered) == 0)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || (s == NP && 0 == compRegistered) - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: ((((((((MPR3 < NP + 5 || NP < 1) || 1 < \old(s)) || 1 == pended) || MPR1 < NP + 4) || (MPR1 == s && 0 == __cil_tmp7 + 1073741802)) || compRegistered < 1) || 1 < NP) || \old(s) < 1) && (((s == SKIP1 || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 775]: Loop Invariant Derived loop invariant: ((s == SKIP1 || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s)) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((s == SKIP1 || 1 == pended) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) && ((((((((((MPR3 < NP + 5 || ((((MPR1 == s && 0 == __cil_tmp7 + 1073741802) && returnVal2 == 259) && 1 <= setEventCalled) && setEventCalled <= 1)) || NP < 1) || 1 < \old(s)) || 1 == pended) || ((MPR1 == s && 0 == __cil_tmp7 + 1073741802) && returnVal2 + 1073741823 <= 0)) || MPR1 < NP + 4) || compRegistered < 1) || 1 < NP) || ((MPR1 == s && 0 == __cil_tmp7 + 1073741802) && 0 == returnVal2)) || \old(s) < 1) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((MPR3 < NP + 5 || NP < 1) || 1 < \old(s)) || 1 == pended) || !(\old(compRegistered) == 0)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || (s == NP && 0 == compRegistered) - InvariantResult [Line: 602]: Loop Invariant Derived loop invariant: (((((MPR3 < NP + 5 || !(\old(s) == NP)) || 1 == pended) || (!(1 == pended) && s == NP)) || MPR1 < NP + 4) || compRegistered < 1) && (((((((((MPR3 < NP + 5 || \old(setEventCalled) < 1) || NP < 1) || 1 == pended) || (!(1 == pended) && s == NP)) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < NP) || 1 < \old(setEventCalled)) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: (((((MPR3 < NP + 5 || !(\old(s) == NP)) || 1 == pended) || (!(1 == pended) && s == NP)) || MPR1 < NP + 4) || compRegistered < 1) && (((((((((MPR3 < NP + 5 || \old(setEventCalled) < 1) || NP < 1) || 1 == pended) || (!(1 == pended) && s == NP)) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < NP) || 1 < \old(setEventCalled)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 251 locations, 1 error locations. SAFE Result, 4.3s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 2947 SDtfs, 1579 SDslu, 3223 SDs, 0 SdLazy, 582 SolverSat, 177 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 82 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 330 PreInvPairs, 403 NumberOfFragments, 2750 HoareAnnotationTreeSize, 330 FomulaSimplifications, 36 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 84 FomulaSimplificationsInter, 1792 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 87896 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...